murali_lec24 - CS C341 / I S C361 Data Structures &...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CS C341 / I S C361 GRAPH ALGORITHMS Graph Generation – Static vs. Dynamic Traversals Depth First Search - Algorithm - Properties and Time Complexity - Applications Breadth First Search 1 02/07/11 Sundar B. CSIS, BITS, Pilani
Background image of page 1

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

View Full DocumentRight Arrow Icon
GRAPH GENERATION Graph generation can be static or dynamic : If the graph on which an algorithm is to be applied is already available then it is static If the graph can change during execution - i.e. insertions / deletions may happen – then it is dynamic Examples Traffic networks Set of states in program execution World Wide Web (web pages and hyperlinks) 02/07/11 2 Sundar B. CSIS, BITS, Pilani
Background image of page 2
Given a graph G, a traversal is a systematic procedure for exploring G by examining its vertices (and edges) E.g. web spider / crawler E.g. find operation in Unix/Linux E.g. A broadcast in a network Depth First Search (DFS) in an undirected graph: A traversal which explores one path completely before exploring another would be “depth” first. “Backtrack” to explore the next path
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 123 taught by Professor Murali during the Spring '11 term at Birla Institute of Technology & Science, Pilani - Hyderabad.

Page1 / 16

murali_lec24 - CS C341 / I S C361 Data Structures &...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online