Presentation is loading. Please wait.

Presentation is loading. Please wait.

Breadth First Search Queue:Dequeued Paths: Start: C Find: E Use a BFS to find the path from C to E that passes through the minimum number of nodes. Show.

Published byHubert Garrison Modified over 10 years ago

Similar presentations

Presentation on theme: "Breadth First Search Queue:Dequeued Paths: Start: C Find: E Use a BFS to find the path from C to E that passes through the minimum number of nodes. Show."— Presentation transcript:

1 Breadth First Search Queue:Dequeued Paths: Start: C Find: E Use a BFS to find the path from C to E that passes through the minimum number of nodes. Show your queue and dequeued paths to the right.

2 Breadth First Search Queue: C Dequeued Paths: Start: C Find: E Step: Enqueue start node.

3 Breadth First Search Queue: C Dequeued Paths: C Start: C Find: E Step: Dequeue next path.

4 Breadth First Search Queue: C A,C F,C Dequeued Paths: C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path in a specific order (alphabetical unless otherwise stated).

5 Breadth First Search Queue: C A,C F,C Dequeued Paths: C A,C Start: C Find: E Step: Dequeue next path.

6 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C Dequeued Paths: C A,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

7 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C Dequeued Paths: C A,C F,C Start: C Find: E Step: Dequeue next path.

8 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C Dequeued Paths: C A,C F,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

9 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C Dequeued Paths: C A,C F,C B,A,C Start: C Find: E Step: Dequeue next path.

10 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C Dequeued Paths: C A,C F,C B,A,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

11 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C Dequeued Paths: C A,C F,C B,A,C F,A,C Start: C Find: E Step: Dequeue next path.

12 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C Dequeued Paths: C A,C F,C B,A,C F,A,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

13 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C Start: C Find: E Step: Dequeue next path.

14 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C B,J,A,C F,J,A,C G,J,A,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

15 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C B,J,A,C F,J,A,C G,J,A,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C A,F,C Start: C Find: E Step: Dequeue next path.

16 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C B,J,A,C F,J,A,C G,J,A,C B,A,F,C J,A,F,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C A,F,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

17 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C B,J,A,C F,J,A,C G,J,A,C B,A,F,C J,A,F,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C Start: C Find: E Step: Dequeue next path.

18 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C B,J,A,C F,J,A,C G,J,A,C B,A,F,C J,A,F,C D,G,F,C E,G,F,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C Start: C Find: E Step: Enqueue paths to all adjacent nodes not already on your path.

19 Breadth First Search Queue: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C J,F,C J,B,A,C G,F,A,C J,F,A,C B,J,A,C F,J,A,C G,J,A,C B,A,F,C J,A,F,C D,G,F,C E,G,F,C Dequeued Paths: C A,C F,C B,A,C F,A,C J,A,C A,F,C G,F,C Start: C Find: E Step: With BFS, you can stop when you enqueue a path to the destination. Answer: C, F, G, E

Download ppt "Breadth First Search Queue:Dequeued Paths: Start: C Find: E Use a BFS to find the path from C to E that passes through the minimum number of nodes. Show."

Similar presentations

BEST FIRST SEARCH - BeFS

BEST FIRST SEARCH - BeFS
1 Breadth First Search s 2 5 4 7 8 369. 2 s 2 5 4 7 8 369 0 Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.

1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Breadth First Search AB F I EH DC G FIFO Queue - front.

Breadth First Search AB F I EH DC G FIFO Queue - front.
CS203 Lecture 15.

CS203 Lecture 15.
0 Course Outline n Introduction and Algorithm Analysis (Ch. 2) n Hash Tables: dictionary data structure (Ch. 5) n Heaps: priority queue data structures.

0 Course Outline n Introduction and Algorithm Analysis (Ch. 2) n Hash Tables: dictionary data structure (Ch. 5) n Heaps: priority queue data structures.
Graphs CSE 331 Section 2 James Daly. Reminders Homework 4 is out Due Thursday in class Project 3 is out Covers graphs (discussed today and Thursday) Due.

Graphs CSE 331 Section 2 James Daly. Reminders Homework 4 is out Due Thursday in class Project 3 is out Covers graphs (discussed today and Thursday) Due.
§3 Shortest Path Algorithms Given a digraph G = ( V, E ), and a cost function c( e ) for e  E( G ). The length of a path P from source to destination.

§3 Shortest Path Algorithms Given a digraph G = ( V, E ), and a cost function c( e ) for e  E( G ). The length of a path P from source to destination.
Graphs COP 3502. Graphs  Train Lines Gainesville OcalaDeltona Daytona Melbourne Lakeland Tampa Orlando.

Graphs COP Graphs  Train Lines Gainesville OcalaDeltona Daytona Melbourne Lakeland Tampa Orlando.
CSE 390B: Graph Algorithms Based on CSE 373 slides by Jessica Miller, Ruth Anderson 1.

CSE 390B: Graph Algorithms Based on CSE 373 slides by Jessica Miller, Ruth Anderson 1.
CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.
Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.

Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.
CS 473Lecture 141 CS473-Algorithms I Lecture 14-A Graph Searching: Breadth-First Search.

CS 473Lecture 141 CS473-Algorithms I Lecture 14-A Graph Searching: Breadth-First Search.
Breadth-First Search Text Read Weiss, § 9.3 (pp. 299-304) Breadth-First Search Algorithms.

Breadth-First Search Text Read Weiss, § 9.3 (pp ) Breadth-First Search Algorithms.
Discussion #31 1/11 Discussion #31 Adjacency Lists; Breadth-First Search & Depth-First Search.

Discussion #31 1/11 Discussion #31 Adjacency Lists; Breadth-First Search & Depth-First Search.
1 Undirected Breadth First Search F A BCG DE H Source:

1 Undirected Breadth First Search F A BCG DE H Source:
Chapter 8, Part I Graph Algorithms.

Chapter 8, Part I Graph Algorithms.
Breadth First Search. Two standard ways to represent a graph –Adjacency lists, –Adjacency Matrix Applicable to directed and undirected graphs. Adjacency.

Breadth First Search. Two standard ways to represent a graph –Adjacency lists, –Adjacency Matrix Applicable to directed and undirected graphs. Adjacency.
CS 206 Introduction to Computer Science II 11 / 07 / 2008 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 11 / 07 / 2008 Instructor: Michael Eckmann.
308-203A Introduction to Computing II Lecture 15: Searching Graphs II Fall Session 2000.

A Introduction to Computing II Lecture 15: Searching Graphs II Fall Session 2000.
1 Breadth First Search AB F I EH DC G FIFO Queue - front.

1 Breadth First Search AB F I EH DC G FIFO Queue - front.

Similar presentations

Ads by Google