Automat - snirSha/The-Maze-Of-Waze-Mark2 GitHub Wiki

This class uses the graph_algo class from a previous assignment (Graphs).

The algorithms used:

  • Shortest Path Distance - the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

  • dijkstra - is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.

  • ShortestPath - like ShortestPathDist but this function return the path.

image