Summary: Graph representationsp p
V number of vertices (nodes), E number of edges
Edge array size: E
Adj i i V * VAdjacency matrix size: V * V
Adjacency lists size: V + E
"pure" representations p p
Adjacency matrix
b d f ha b c d e f g h
a 0 1 0 0 1 0 1 0
b 1 0 1 0 0 0 0 1
0 1 0 1 0 1 1 0c 0 1 0 1 0 1 1 0
d 0 0 1 0 1 0 0 0
e 1 0 0 1 0 0 0 0
f 0 0 1 0 0 0 1 0f 0 0 1 0 0 0 1 0
g 1 0 1 0 0 0 0 0
h 0 1 0 0 0 0 0 0
Adjacency List
a: b e g
b: c hb: c h
c: b g

Source: Albert, Réka - Departments of Biology & Physics, Pennsylvania State University

Collections: Biology and Medicine