BFS-handouts-2

# BFS-handouts-2 - Breadth-First Search 3/13/2006 1:42 AM...

This preview shows pages 1–3. Sign up to view the full content.

Breadth-First Search 3/13/2006 1:42 AM 1 3/13/2006 1:42 AM Breadth-First Search 1 Breadth-First Search C B A E D L 0 L 1 F L 2 3/13/2006 1:42 AM Breadth-First Search 2 Outline and Reading Breadth-first search (§6.3.3) ± Algorithm ± Example ± Properties ± Analysis ± Applications DFS vs. BFS (§6.3.3) ± Comparison of applications ± Comparison of edge labels

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Breadth-First Search 3/13/2006 1:42 AM 2 3/13/2006 1:42 AM Breadth-First Search 3 Breadth-First Search Breadth - first search (BFS) is a general technique for traversing a graph A BFS traversal of a graph G ± Visits all the vertices and edges of G ± Determines whether G is connected ± Computes the connected components of G ± Computes a spanning forest of G BFS on a graph with n vertices and m edges takes O ( n + m ) time BFS can be further extended to solve other graph problems ± Find and report a path with the minimum number of edges between two given vertices ± Find a simple cycle, if there is one 3/13/2006 1:42 AM Breadth-First Search 4 BFS Algorithm
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 09/10/2009 for the course CS 401 taught by Professor Cs401 during the Spring '08 term at Illinois Tech.

### Page1 / 6

BFS-handouts-2 - Breadth-First Search 3/13/2006 1:42 AM...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online