GPS Graph Navigation

[NimrodRak]

Given a graph of vertices and edges, find the shortest way from vertex A to vertex B. This is similar to GPS navigation because we can say that each vertex is intersection and each edge is a road.

[NicholasACTran]

This is just any form of pathfinding algorithm, should probably start with A*

[NimrodRak]

This is just any form of pathfinding algorithm, should probably start with A*

But then how do we determine the heuristic function? do we request the user to input it? we need a "real scenario" for that to work.

[NicholasACTran]

With algorithms like this, the implementation should be a toy implementation, thus, should have some assumptions involved. There are enough common heuristics for A*, that choosing a common one is fine for implementing the algorithm. The purpose is understanding the algorithm, not to create a robust system.