1. Topic 13
Graphs 2

2. Minimum Spanning Tree (MST)

3. Applications
Wikipedia.com
mathworks.com

4. Prim’s MST Algorithm

5. Pseudocode

6. Proof

9. Kruskal’s MST Algorithm

12. Announcements Homework 7 is up Participation 6 is up Final in 2 weeks
No office hours next Thursday

13. Single Source Shortest Path Algorithms (SSSP)
Definition:

14. Dijkstra’s Algorithm

15. Dijkstra’s Algorithm
Known
Fringe

16. Pseudocode

17. Analysis

18. Using Heaps

19. Observation (before proof)

20. Proof

21. SSSP using BFS

24. Bellman-Ford
d(source, *)
Parent
Edge (u->v)
Pass 1
Pass 2
Pass 3

25. Pseudocode

26. Analysis

27. Topological Sort
Def:

28. UC Santa Cruz Curriculum

29. SLIC
System has a lot of dependences  use Makefiles

30. Example

31. Pseudocode

32. Analysis