This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Algorithms in Systems Engineering IE170 Lecture 16 Dr. Ted Ralphs IE170 Lecture 16 1 References for Todays Lecture Required reading CLRS Chapter 24 References R. Sedgewick, Algorithms in C++ (Third Edition), 1998. IE170 Lecture 16 2 Breadthfirst Search Recall from last time that processing the vertices in firstin, firstout (FIFO) order results in an algorithm called breadthfirst search (BFS). This corresponds to the policy of choosing a vertex at minimum depth in the search tree as the next to be processed. The implementation is identical to DFS , except that the neighbors of the vertex being processed are inserted into a queue , instead of a stack . This creates a very shallow search tree, unlike DFS. IE170 Lecture 16 3 BFS and Shortest Paths Consider the problem of finding the shortest path from a vertex u to a vertex v . A shortest path from u to v is a path containing the fewest intermediate vertices. A shortest paths tree (SPT) is a rooted tree in which the path from the root vertex to each other vertex in the graph is a shortest such path in the original graph....
View Full
Document
 Spring '07
 Ralphs
 Systems Engineering

Click to edit the document details