notes20b

Anundirectedgraphisconnected

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: , 4 CS 234 Lecture 20 Page 1 Graphs can have weights assigned to its edges. An undirected graph is connected if there is a path between any two vertices. Properties of Undirected Graphs Let | |, | |. Then, 1 1. order O 2 2. 1 for connected graphs 1 for trees 3. The number of graphs with vertices is 2 4. deg 2 i. e. the sum of the degrees in a graph is twice the number of edges ∈ ADT Graph Data collection of vertices and edges Operations Graph V,E isEmpty numVertices numEdges vertices edges neighbours v isAdjacent v1, v2 path v1, v2 addVertex v removeVertex v addEdge v1, v2 removeEdge v1, v2 traverse v isConnected CS...
View Full Document

This note was uploaded on 02/04/2014 for the course CS 234 taught by Professor Baranoski during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online