Graph algorithms: Dijkstra, Bellman-Ford, MST (Kruskal, Prim)
Design and Analysis of Algorithms · Engineering
Study notes
A fully worked example for this topic is being prepared. Start with the key idea above, then test yourself with the quiz below — being able to explain the concept in your own words is the best check that you understand it.