lec12

# lec12 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .

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

View Full Document
Lecture 12 Searching I: Graph Search Representations 6.006 Spring 2008 Lecture 12: Searching I: Graph Search and Representations Lecture Overview: Search 1 of 3 Graph Search Applications Graph Representations Introduction to breadth-frst and depth-frst search Readings CLRS 22.1-22.3, B.4 Graph Search Explore a graph e.g., fnd a path From start vertices to a desired vertex Recall : graph G = ( V, E ) V = set oF vertices (arbitrary labels) E = set oF edges i.e. vertex pairs ( v, w ) ordered pair = directed edge oF graph unordered pair = undirected a b c d a b c UNDIRECTED DIRECTED e.g. V = {a,b,c,d} E = {{a,b},{a,c}, {b,c},{b,d}, {c,d}} V = {a,b,c} E = {(a,c),(b,c), (c,b),(b,a)} ±igure 1: Example to illustrate graph terminology 1
Lecture 12 Searching I: Graph Search Representations 6.006 Spring 2008 Applications: There are many. web crawling ( How Google fnds pages ) social networking ( Facebook ±riend fnder ) computer networks ( Routing in the Internet ) shortest paths [next

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 09/24/2010 for the course CS 6.006 taught by Professor Erikdemaine during the Spring '08 term at MIT.

### Page1 / 9

lec12 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

View Full Document
Ask a homework question - tutors are online