Class Notes (835,430)
Canada (509,186)
CSC263H1 (54)
Lecture 16

Lecture 16.docx

2 Pages
98 Views
Unlock Document

Department
Computer Science
Course
CSC263H1
Professor
Toniann Pitassi
Semester
Winter

Description
Graph Search - Start at some node and explore it by following its edges to discover new nodes - explore newly discovered nodes etc 2 Types of graph searches 1) breadth - first. search(BFS) -- use adjacency list with this graph a) explore s: follow edges out of s to discover new nodes b) Explore nodes in the order they were discovered: first discovered first explored v ∈ V colour(v) = white means its not discovered colour(v) = grey means its discovered colour(v) = black means it was discovered and explored P(v) = u iff "u discovered v" (parent of v) s → u1 → u2 → … → u → v d[v] = d[u] + 1 (length/ number of edges of v is u + 1) G=( v, e), BFS(0, s) co
More Less

Related notes for CSC263H1

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit