Flashcards
Dijkstra, Bellman-Ford, topological sort, Kruskal, Prim, Huffman coding and greedy proofs, with worked examples.
Using Dijkstra from A, what are the final distances to B, C, D and E?
Tap to flip
C = 2, B = 3 (via C), D = 8 (via B), E = 11 (via D).
Tap to see the front