lecture07

# lecture07 - Importance in graphs COMPUTER SCIENCE 51 Spring...

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

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

View Full Document
2/24/2009 2 Pirate-lite example “Generative model” for Pirate-speak Reflects a grammar and parser also! “Avast!” “Ye” “Yon” “salty” “scurvy” “wel- dressed” “TFs” “students” “faculty?!” “CS51” What is a walk on a graph? A walk from an initial node R on a graph is a function F such that F goes from t={0,1,2…} to nodes F(0) = R If F(i) = v and F(i+1) = v’, then there is an edge from v to v’ Note: HOP examples abound Given a graph, return a walk Given a graph and a function, check that function is a walk (to depth n) What do walks represent? So far: permitted states of affairs
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 07/26/2009 for the course COMPUTERSC CS51 taught by Professor Gregmorrisett during the Spring '09 term at Harvard.

### Page1 / 5

lecture07 - Importance in graphs COMPUTER SCIENCE 51 Spring...

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

View Full Document
Ask a homework question - tutors are online