IIT Bombay Data Structures and Algorithms Prof Ajit

IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering IIT Bombay Session: Graph Traversal (Breadth-First Search) Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 1

Breadth-First Search IIT Bombay • • Algorithm for traversing through (graph/tree) Traverses breadth wards Uses queue to implement it Applications • Shortest Path First Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 2

BFS Algorithm [1] IIT Bombay procedure BFS(G, node): let S be a queue S. push(node) while S is not empty node = S. pop() if node is not visited: mark node as visited for all edges from node to adjacent. Nodes in G do S. push(adjacent. Nodes) [1] Breadth-first Search, available at https: //en. wikipedia. org/wiki/Breadth-first_search , accessed on 11 Aug 2016 Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 3

Graph IIT Bombay B D A E C Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 4

BFS IIT Bombay B D A E C Visiting: A Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 5

BFS IIT Bombay B D A E C Visiting: A, B Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 6

BFS IIT Bombay B D A E C Visiting: A, B, C Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 7

BFS IIT Bombay B D A E C Visiting: A, B, C, D Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 8

BFS IIT Bombay B D A E C Visiting: A, B, C, D, E Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 9

IIT Bombay Thank you Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 10