Shortest path algorithms info Flashcards
1
Q
What is Dijkstra’s shortest path algorithm?
A
An algorithm to find the shortest path between a start and end nodes on a weighted graph
2
Q
what is the ‘least cost path’?
A
it is the best way to get from node to node
3
Q
what is the purpose of Dijkstra’s algorithm?
A
find the shortest path from the start node to all other nodes on the graph
4
Q
what is the output from Dijkstra’s algorithm?
A
a list which holds:
- the node label
- the cost of the shortest path to that node
- the label of the previous node in the path
5
Q
A