Niko drives from his home to university.

The network below shows the distances, in kilometres, along a series of streets connecting Niko’s home to the university.

The vertices `A`, `B`, `C`, `D` and `E` represent the intersection of these streets.
 

The shortest path for Niko from his home to the university could be found using

1. a minimum cut.
2. Prim’s algorithm.
3. Dijkstra’s algorithm.
4. critical path analysis.
5. the Hungarian algorithm.