# Computing - Searching Graphs

> Source: https://ollybritton.com/notes/a-level/computing/topics/searching-graphs/ · Updated: 2021-04-27 · Tags: computing, school

## See Also
## 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
$$

---
Olly Britton — https://ollybritton.com. Machine-readable index: https://ollybritton.com/llms.txt
