Computing - Searching Graphs

Created: April 27, 2021

Flashcards

What does Dijkstra’s algorithm find?

The shortest path from every node to a goal node.

What are the three columns of the table that get filled in for Dijkstra’s algorithm?

Vertex, shortest distance, previous vertex

What is shortest distance to the goal node from the goal node when running Dijkstra’s algorithm?

\[0\]

What is the shortest distance to the goal node from any node but the goal node at the start of Dijkstra’s algorithm?

\[\ifty\]

[[Computing - Syllabus]]^A

(incoming)
[[Further Maths - Floyd's Algorithm]]^A

(sim: 0.712)
[[Further Maths - Dijkstra's Algorithm]]^A

(sim: 0.594)
[[Further Maths - Kruskal's Algorithm]]^A

(sim: 0.491)
[[Further Maths - Prim's Algorithm]]^A

(sim: 0.473)
[[Further Maths - Route Inspection]]^A

(sim: 0.456)