Raphs: - Definitions - The Graph ADT - Data Structures For Graphs

GRAPHS
Denitions The Graph ADT Data structures for graphs
PVD LAX HNL DFW FTL STL
Graphs
What is a Graph?
A graph G = (V,E) is composed of: V: set of vertices E: set of edges connecting the vertices in V An edge e = (u,v) is a pair of vertices Example: V= {a,b,c,d,e} a c d e b E= {(a,b),(a,c),(a,d), (b,e),(c,d),(c,e), (d,e)}
Graphs
Applications
electronic circuits CS16
start nd the path of least resistance to CS16 networks (roads, ights, communications)
PVD LAX HNL DFW FTL STL
Graphs
mo better examples
A Spike Lee Joint Production
scheduling (project planning) wake up cs16 meditation work play cs16 program cxhextris make cookies for cs16 HTA sleep dream of cs16 A typical student day eat
more cs16
Graphs
Graph Terminology
adjacent vertices: connected by an edge degree (of a vertex): # of adjacent vertices 3 2
deg(v) = 2(# edges)

vV
3 3 3
Since adjacent vertices each count the adjoining edge, it will be counted twice
path: sequence of vertices v1,v2,. . .vk such that consecutive vertices vi and vi+1 are adjacent. a c d abedc e d bedc b a c e b
Graphs
More Graph Terminology

simple path: no repeated vertices a c d e b bec
cycle: simple path, except that the last vertex is the same as the rst vertex a c d e b acda
Graphs
Even More Terminology

connected graph: any two vertices are connected by some path
connected
not connected
subgraph: subset of vertices and edges forming a graph connected component: maximal connected subgraph. E.g., the graph below has 3 connected components.
Graphs
Caramba! Another Terminology Slide!

(free) tree - connected graph without cycles forest - collection of trees
tree
tree
forest tree tree
Graphs
Connectivity
Let n = #vertices m = #edges - complete graph - all pairs of vertices are adjacent m= (1/2) deg(v) = (1/2) (n - 1) = n(n-1)/2
vV vV
Each of the n vertices is incident to n - 1 edges, however, we would have counted each edge twice!!! Therefore, intuitively, m = n(n-1)/2.
n=5 m = (5 4)/2 = 10
Therefore, if a graph is not complete, m < n(n-1)/2
Graphs
More Connectivity
n = #vertices m = #edges For a tree m = n - 1 n=5 m=4
If m < n - 1, G is not connected n=5 m=3
Graphs
10
Spanning Tree
A spanning tree of G is a subgraph which - is a tree - contains all vertices of G
spanning tree of G
Failure on any edge disconnects system (least fault tolerant)
Graphs
11
AT&T vs. RT&T

(Roberto Tamassia & Telephone)
Roberto wants to call the TAs to suggest an extension for the next program...
TA But Plant-Ops accidentally cuts a phone cable!!! TA TA TA TA
One fault will disconnect part of graph!! A cycle would be more fault tolerant and only requires n edges
Graphs
12
Euler and the Bridges of Koenigsberg
Gilligans Isle?
C A B D
Pregal River
Can one walk across each bridge exactly once and return at the starting point? Consider if you were a UPS driver, and you didnt want to retrace your steps. In 1736, Euler proved that this is not possible
Graphs
13
Graph Model(with parallel edges)
C A B
Eulerian Tour: path that traverses every edge exactly once and returns to the rst vertex Eulers Theorem: A graph has a Eulerian Tour if and only if all vertices have even degree Do you nd such ideas interesting? Would you enjoy spending a whole semester doing such proofs?
Well, look into CS22!

if you dare...
Graphs 14
The Graph ADT

The Graph ADT is a positional container whose positions are the vertices and the edges ofthe graph. - size() Return the number of vertices plus the number of edges of G.
isEmpty() elements() positions() swap() replaceElement()
Notation: Graph G; Vertices v, w; Edge e; Object o - numVertices() Return the number of vertices of G. - numEdges() Return the number of edges of G. - vertices() Return an enumeration of the vertices of G. - edges() Return an enumeration of the edges of G.
Graphs
15
The Graph ADT (contd.)

- directedEdges() Return an enumeration of all directed edges in G. - undirectedEdges() Return an enumeration of all undirected edges in G. - incidentEdges(v) Return an enumeration of all edges incident on v. - inIncidentEdges(v) Return an enumeration of all the incoming edges to v. - outIncidentEdges(v) Return an enumeration of all the outgoing edges from v. - opposite(v, e) Return an endpoint of e distinct from v - degree(v) Return the degree of v. - inDegree(v) Return the in-degree of v. - outDegree(v) Return the out-degree of v.
Graphs 16
More Methods ...

- adjacentVertices(v) Return an enumeration of the vertices adjacent to v. - inAdjacentVertices(v) Return an enumeration of the vertices adjacent to v along incoming edges. - outAdjacentVertices(v) Return an enumeration of the vertices adjacent to v along outgoing edges. - areAdjacent(v,w) Return whether vertices v and w are adjacent. - endVertices(e) Return an array of size 2 storing the end vertices of e. - origin(e) Return the end vertex from which e leaves. - destination(e) Return the end vertex at which e arrives. - isDirected(e) Return true iff e is directed.
Graphs 17
Update Methods
- makeUndirected(e) Set e to be an undirected edge. - reverseDirection(e) Switch the origin and destination vertices of e. - setDirectionFrom(e, v) Sets the direction of e away from v, one of its end vertices. - setDirectionTo(e, v) Sets the direction of e toward v, one of its end vertices. - insertEdge(v, w, o) Insert and return an undirected edge between v and w, storing o at this position. - insertDirectedEdge(v, w, o) Insert and return a directed edge between v and w, storing o at this position. - insertVertex(o) Insert and return a new (isolated) vertex storing o at this position. - removeEdge(e) Remove edge e.
Graphs 18
Data Structures for Graphs

A Graph! How can we represent it? To start with, we store the vertices and the edges into two containers, and we store with each edge object references to its endvertices
TW 45
NW
JFK ORD BOS
DL 3
AA 903
MIA
SFO
A U
AA
LAX
AA 49
DFW
AA
AA 411
523
Additional structures can be used to perform efciently the methods of the Graph ADT
Graphs
DL
19
8 13
247
20 1
UA 8 77
35
35
Edge List
The edge list structure simply stores the vertices and the edges into unsorted sequences. Easy to implement. Finding the edges incident on a given vertex is inefcient since it requires examining the entire edge sequence
E
NW 35 DL 247 AA 49 DL 335 AA 1387 AA 523 AA 411 UA 120 AA 903 UA 877 TW 45
BOS
LAX
DFW
JFK
MIA
ORD
SFO
Graphs
20
Performance of the Edge List Structure

Operation size, isEmpty, replaceElement, swap numVertices, numEdges vertices edges, directedEdges, undirectedEdges elements, positions endVertices, opposite, origin, destination, isDirected, degree, inDegree, outDegree incidentEdges, inIncidentEdges, outIncidentEdges, adjacentVertices, inAdjacentVertices, outAdjacentVertices, areAdjacent insertVertex, insertEdge, insertDirectedEdge, removeEdge, makeUndirected, reverseDirection, setDirectionFrom, setDirectionTo removeVertex Time O(1) O(1) O(n) O(m) O(n+m) O(1) O(m)
O(1)
O(m)
Graphs
21
Adjacency List (traditional)

adjacency list of a vertex v: sequence of vertices adjacent to v represent the graph by the adjacency lists of all the vertices a c d a b c d e Space = (N +
Graphs
e b a a a b c e d c c e e d d
deg(v)) = (N + M)
22
Adjacency List (modern)

The adjacency list structure extends the edge list structure by adding incidence containers to each vertex.
NW 35 DL 247
AA 49
DL 335 AA 1387 AA 523 AA 411 UA 120 AA 903 UA 877 TW 45
BOS
LAX
DFW
JFK
MIA
ORD
SFO
in
out
NW 35 DL 247
in
out
in
out
in
out
in
out
in
out
in
TW 45
out
AA 49 UA 120 AA 411
AA1387 DL335 UA 877 AA 49 AA 523
NW 35 AA1387 AA 903 TW 45
DL 247 AA523 AA 903 AA 411
UA 120 UA 877 DL 335
The space requirement is O(n + m).

Graphs 23
Performance of the Adjacency List Structure

Operation size, isEmpty, replaceElement, swap numVertices, numEdges vertices edges, directedEdges, undirectedEdges elements, positions endVertices, opposite, origin, destination, isDirected, degree, inDegree, outDegree incidentEdges(v), inIncidentEdges(v), outIncidentEdges(v), adjacentVertices(v), inAdjacentVertices(v), outAdjacentVertices(v) areAdjacent(u, v) Time O(1) O(1) O(n) O(m) O(n+m) O(1)
O(deg(v))
O(min(deg(u), deg(v))) insertVertex, insertEdge, insertDirected- O(1) Edge, removeEdge, makeUndirected, reverseDirection, removeVertex(v) O(deg(v))
Graphs 24
Adjacency Matrix (traditional)

a c d e b a b c d e a F T T T F b T F F F T c T F F T T d T F T F T e F T T T F
matrix M with entries for all pairs of vertices M[i,j] = true means that there is an edge (i,j) in the graph. M[i,j] = false means that there is no edge (i,j) in the graph. There is an entry for every possible edge, therefore: Space = (N2)
Graphs
25
Adjacency Matrix (modern)

The adjacency matrix structures augments the edge list structure with a matrix where each row and column corresponds to a vertex. 0 0 1 2 3 4 5 6

1
AA 1387 AA 523 UA 877
2
NW 35
3
AA 49 AA 411
4
DL 247 AA 903
5
DL 335 UA 120
6
TW 45
BOS DFW JFK LAX MIA ORD SFO 0 1 2 3 4 5 6 The space requirement is O(n2 + m)
Graphs 26
Performance of the Adjacency Matrix Structure

Operation size, isEmpty, replaceElement, swap numVertices, numEdges vertices edges, directedEdges, undirectedEdges elements, positions endVertices, opposite, origin, destination, isDirected, degree, inDegree, outDegree incidentEdges, inIncidentEdges, outIncidentEdges, adjacentVertices, inAdjacentVertices, outAdjacentVertices, areAdjacent insertEdge, insertDirectedEdge, removeEdge, makeUndirected, reverseDirection, setDirectionFrom, setDirectionTo insertVertex, removeVertex Time O(1) O(1) O(n) O(m) O(n+m) O(1) O(n)
O(1) O(1)
O(n2)
Graphs
27

Raphs: - Definitions - The Graph ADT - Data Structures For Graphs

Uploaded by

Copyright:

Available Formats

Raphs: - Definitions - The Graph ADT - Data Structures For Graphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Raphs: - Definitions - The Graph ADT - Data Structures For Graphs

Uploaded by

Copyright:

Available Formats

GRAPHS

Denitions The Graph ADT Data structures for graphs

PVD LAX HNL DFW FTL STL

PVD LAX HNL DFW FTL STL

deg(v) = 2(# edges)

More Graph Terminology

Even More Terminology

Caramba! Another Terminology Slide!

forest tree tree

Therefore, if a graph is not complete, m < n(n-1)/2

If m < n - 1, G is not connected n=5 m=3

Failure on any edge disconnects system (least fault tolerant)

AT&T vs. RT&T

TA But Plant-Ops accidentally cuts a phone cable!!! TA TA TA TA

Euler and the Bridges of Koenigsberg

Graph Model(with parallel edges)

Well, look into CS22!

The Graph ADT

isEmpty() elements() positions() swap() replaceElement()

The Graph ADT (contd.)

More Methods ...

Data Structures for Graphs

Performance of the Edge List Structure

Adjacency List (traditional)

Adjacency List (modern)

DL 335 AA 1387 AA 523 AA 411 UA 120 AA 903 UA 877 TW 45

AA1387 DL335 UA 877 AA 49 AA 523

DL 247 AA523 AA 903 AA 411

UA 120 UA 877 DL 335

The space requirement is O(n + m).

Performance of the Adjacency List Structure

Adjacency Matrix (traditional)

Adjacency Matrix (modern)

Performance of the Adjacency Matrix Structure

You might also like