Graph Theory, Part IV
Lecture for today:
Complete the discussion of planar graphs from last time (see
yesterday's lecture notes
).
Go over Kruskal's algorithm for finding minimum spanning trees (see
Lab 4
).
Start discussion of Dijkstra's algorithm for finding shortest paths (see
tomorrow's lecture notes
).