Algorithms
Graph Algorithms
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Graph Algorithms Three - Introduction to Algorithms - Lecture Slides, Slides of Computer Science
These are the Lecture Slides of Introduction to Algorithms which includes Expensive Operations, Sort Edges, Running Time, Upshot, Union, Makeset, Disjoint Set, Disjoint Set Union, Naïve Implementation etc. Key important points are: Graph Algorithms Three, Depth First Search, Strategy, Exploring a Graph, Possible, Unexplored Edges, Vertex, Backtrack, Discovered, Code
Typology: Slides
2012/2013
1 / 35
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Graph Algorithms Three - Introduction to Algorithms - Lecture Slides and more Slides Computer Science in PDF only on Docsity!
Algorithms
Graph Algorithms
Review: Depth-First Search
● Depth-first search is another strategy for
exploring a graph
■ Explore “deeper” in the graph whenever possible
■ Edges are explored out of the most recently
discovered vertex v that still has unexplored edges
■ When all of v ’s edges have been explored,
backtrack to the vertex from which v was
discovered
source vertex
source vertex d f
source vertex d f
source vertex d f
source vertex d f
source vertex d f
source vertex d f
What is the structure of the yellow vertices? What do they represent?
source vertex d f
source vertex d f
source vertex d f
source vertex d f
source vertex d f