lec0422-Graphs - Announcements MP 7 available EC Due 4/22...

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

Announcements: MP 7 available. EC Due 4/22, 11:59p. Due 5/2, 11:59p. Today: Graphs - Weiss, Chapter 9

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

View Full Document
How do we get from here to there? Need: 1. Common Vocabulary 2. Graph implementation 3. Traversal 4. Algorithms.
Graph Vocabulary: Incident edges(6) Degree(6) Adjacent vertices(6) Path(G 2 ) Cycle(G 1 ) Simple graph(G) G = (V,E) |V| = n |E| = m G 1 G 2 G 3

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

View Full Document
Graph Vocabulary: Subgraph(G) – G’ = (V’, E’), V’__ V, E’ ___ E, and (u,v) ___ E’ implies u___V’ and v ___ V’. Complete subgraph(G 2 ) – Connected component(G) – Acyclic subgraph(G 2 ) – Spanning tree(G 1 ) – G = (V,E) |V| = n |E| = m G 1 G 2 G 3
Graphs: theory that will help us in analysis How many edges? At least: connected – not connected - At most: simple - not simple - Relationship to degree sum: X U V W Z Y a c b e d f g h deg( v ) = v V G = (V,E) |V| = n |E| = m Running times often reported in terms of n, the number of vertices, but they often depend on m, the number of edges.

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

View Full Document
Thm: Every minimally connected graph G=(V,E) has |V|-1 edges. Proof:
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/26/2012 for the course CS CS 225 taught by Professor Heeren during the Spring '09 term at University of Illinois, Urbana Champaign.

Page1 / 11

lec0422-Graphs - Announcements MP 7 available EC Due 4/22...

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

View Full Document
Ask a homework question - tutors are online