CSE 589 Applied Algorithms Spring 1999
Instructors
Resources
Engagement by Students
Final Exam and Grading
Some Topics
Along the Way
What We’ll Do Today
Applied Algorithm Scenario
Modeling
Broadcasting in a Network
Spanning Tree in a Graph
Undirected Graph
Spanning Tree Problem
Depth First Search Algorithm
Example of Depth First Search
Example Step 2
Example Step 3
Example Step 4
Example Step 5
Example Step 6
Example Step 7
Spanning Tree Algorithm
Evaluation Step Expanded
Correctness of ST Algorithm
Correctness (cont.)
Data Structure Step
Edge List and Adjacency Lists
Adjacency Matrix
Data Structure Choice
Spanning Tree with Adjacency Lists
Performance Step
Performance of ST Algorithm
Other Uses of Depth First Search
Email: ladner@cs.washington.edu
Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/
Other information: CSE 589: Applied Algorithms
Download presentation source