loading

Pathfinding

EXAMPLE PATHFINDING

This page shows an example from the Pathfinder algorithm on 1000 Vertices and 5000 Edges. We searched for the shortest and the cheapest path between the randomly selected Vertices 518 and 492.

The program outputs two text files and shows one shortest and one cheapest path on the console.

Vertex 518 Vertex 246 Vertex 658 Vertex 22 Vertex 506 Vertex 419 Vertex 530 Vertex 820 Vertex 492 | Length: 8
Vertex 518 Vertex 246 Vertex 658 Vertex 22 Vertex 506 Vertex 419 Vertex 530 Vertex 820 Vertex 492 | Cost: 75

In the example we can see that the graph has tow shortest paths and one cheapest path, but only one was printed out, as we are only interested in a shortest path, not all the possibilities. Also there were not may paths found, but theoretically there could be a lot more for a different search.

explore Java project on github

 

Project made by Jan Schelhaas and Felix Lausch

2018