CSE 326: Data Structures Lecture #23 Dijkstra and Kruskal (sittin’ in a graph)
Today’s Outline
Connectivity
Graph Density
Trees as Graphs
Directed Acyclic Graphs (DAGs)
Begin Friday
Single Source, Shortest Path
The Trouble with Negative Weighted Cycles
Unweighted Shortest Path Problem
Dijkstra
Dijkstra’s Algorithm for Single Source Shortest Path
Intuition in Action
Dijkstra’s Pseudocode (actually, our pseudocode for Dijkstra’s algorithm)
Dijkstra’s Algorithm in Action
The Cloud Proof
Inside the Cloud (Proof)
Data Structures for Dijkstra’s Algorithm
Fibonacci Heaps
Spanning Tree
Kruskal’s Algorithm for Minimum Spanning Trees
Kruskal’s Algorithm in Action (1/5)
Kruskal’s Algorithm in Action (2/5)
Kruskal’s Algorithm in Action (3/5)
Kruskal’s Algorithm in Action (4/5)
Kruskal’s Algorithm Completed (5/5)
Proof of Correctness
Data Structures for Kruskal’s Algorithm
To Do
Coming Up
Email: owner-cse326@cs.washington.edu
Home Page: http://www.cs.washington.edu/326/
Download presentation source