CSE331 Lecture 11

CSE331 Lecture 11 - n vertices HW 2 due today Q1 Q2 and Q3...

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

View Full Document Right Arrow Icon
Lecture 11 CSE 331 Sep 23, 2011
Background image of page 1

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

View Full DocumentRight Arrow Icon
HW 2 due today Q2, Q3 and Q4 in different piles I will not take any HW after 1:15pm
Background image of page 2
Solutions to HW 2 Handed out at the END of the lecture
Background image of page 3

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

View Full DocumentRight Arrow Icon
HW 3 Has been posted (link on the blog) Start early
Background image of page 4
Graded HW 1 Pick up from recitation/TA office hours next week
Background image of page 5

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

View Full DocumentRight Arrow Icon
Graphs Representation of relationships between pairs of entities/elements Vertex Vertex Edge Edge # vertices = n #edges = m # vertices = n #edges = m
Background image of page 6
Paths Sequence of vertices connected by edges , , , Path length 3 Path length 3 , Connecte d Connecte d
Background image of page 7

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

View Full DocumentRight Arrow Icon
Connectivity u and v are connected iff there is a path between them A graph is connected iff all pairs of vertices are connected
Background image of page 8
Connected Graphs Every pair of vertices has a path between them
Background image of page 9

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

View Full DocumentRight Arrow Icon
Cycles Sequence of k vertices connected by edges, first k-1 are distinct , , ,
Background image of page 10
Background image of page 11

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

View Full DocumentRight Arrow Icon
Puzzle # 3 How many distinct graphs on n vertices? How many distinct trees on
Background image of page 12
Background image of page 13

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

View Full DocumentRight Arrow Icon
Background image of page 14
Background image of page 15

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

View Full DocumentRight Arrow Icon
Background image of page 16
Background image of page 17

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

View Full DocumentRight Arrow Icon
Background image of page 18
Background image of page 19

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

View Full DocumentRight Arrow Icon
Background image of page 20
Background image of page 21
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n vertices? HW 2 due today Q1, Q2 and Q3 in different piles I will not take any HW after 1:15pm Tree Connected undirected graph with no cycles Rooted Tree A rooted tree Pick any vertex as root Let the rest of the tree hang under “gravity” How many rooted trees can an n vertex tree have? How many rooted trees can an n vertex tree have? SG’s parent=AC SG’s parent=AC AC’ s chil d=S G AC’ s chil d=S G Rest of Today’s agenda Prove n vertex tree has n-1 edges Algorithms for checking connectivity Checking by inspection What about large graphs? s t Are s and t connected? Brute-force algorithm? List all possible vertex sequences between s and t Check if any is a path between s and t n n such sequences n n such sequences Algorithm motivation al l al l...
View Full Document

This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.

Page1 / 21

CSE331 Lecture 11 - n vertices HW 2 due today Q1 Q2 and Q3...

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

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