Chapter 6 Graphs

„ The Graph Abstract Data Type

„ Elementary Graph Operations
„ Minimum Cost Spanning Trees
„ Shortest Paths and Transitive Closure
„ Activity Networks

C-C Tsai P.1

Introduction
„ Königsberg problem: A river Pregel flows around the
island Keniphof and then divides into two. Four land
areas A, B, C, and D have this river on their borders.
The four lands are connected by 7 bridges, a – g.
„ Is there a possible way to traverse every bridge
exactly once.

C g

c
d

e
A D

a b

B f

C-C Tsai P.2

1
 Introduction
„ Euler used graph theory to solve seven bridges of
Königsberg problem. Euler showed that there is a walk
starting at any vertex, going through each edge exactly
once and terminating at the start vertex iff the degree of
each vertex is even. This walk is called Eulerian or Euler
tour.
„ No Eulerian walk of the Konigsberg bridge problem since
all four vertices are of odd edges.
B->a->A->e->D->g->C->d->A->b->B->f->D ???

C g

c
d

e
A D

a b

B f
C-C Tsai P.3

Graph Definition
„ A graph G=(V,E), V and E are two sets
„ V: finite non-empty set of vertices
„ E: set of pairs of vertices, edges
Example: a graph G1
„ V(G1)={0,1,2,3}, four vertices
„ E(G1)={(0,1),(0,2), (0,3),(1,2),(1,3), (2,3)}, six edges

1 2

3
C-C Tsai P.4

2
 Undirected and Directed Graphs
„ Undirected graph
„ The pair of vertices representing any edge is unordered. Thus, the
pairs (u,v) and (v,u) represent the same edge
Example: a graph G2 0
„ V(G2)={0,1,2,3,4,5,6}
„ E(G2)={(0,1),(0,2), (1,3),(1,4),(2,5),(2,6)} 1 2
G2 is also a tree that is a special case of graph

3 4 5 6
„ Directed graph (or digraph)
„ each edge is represented by a ordered pairs <u,v>
Example: a graph G3 0
„ V(G3)={0,1,2}
„ E(G3)={<0,1>,<1,0>,<1,2>}
1

2
C-C Tsai P.5

Examples of Graphlike Structures

„ Graph with self loops „ Multigraph

0 1

1 2

2
3

C-C Tsai P.6

3
 Complete Graph
„ A complete graph is a graph that has the
maximum number of edges
„ For undirected graph with n vertices, the maximum
number of edges is n(n-1)/2
„ For directed graph with n vertices, the maximum
number of edges is n(n-1)
Example: G1 0
„ edges is 4*(4-1) /2 = 6edges

1 2

3
C-C Tsai P.7

Adjacent and Incident

„ If (u,v) is an edge in an undirected graph,
„ Adjacent: u and v are adjacent
„ Incident: The edge (u,v) is incident on vertices u and v
„ If <u,v> is an edge in a directed graph
„ Adjacent: u is adjacent to v, and v is adjacent from u
„ Incident: The edge <u,v> is incident on u and v

u v

C-C Tsai P.8

4
 Subgraph
„ A subgraph of G is a graph G’ such that
„ V(G’) ⊆ V(G), E(G’) ⊆ E(G)
„ Some of the subgraph of G1
0 0
0 1 2 1 2
1 2 0
1 2 3 3
3
G1 (i) (ii) (iii) (iv)

„ Some of the subgraphsof G3

0
0 0
0 1 1
1 0
1 2 2
2
C-C Tsai
(i) (ii) (iii) (iv) P.9
G3

Path
„ Path from u to v in G
„ a sequence of vertices u, i1, i2,...,ik, v
„ If G is undirected: (u,i1), (i1,i2),..., (ik,v) ∈ E(G)
„ If G is directed: <u,i1>,<i1,i2>,...,<ik,v> ∈ E(G)
„ Length
„ The length of a path is the number of edges on it.
Example: Length of 0,1,3,2 is 3
„ Simple path

„ is a path in which all vertices except possibly the 0

first and last are distinct.
Example: 0,1,3,2 is simple path 1 2
0,1,3,1 is path but not simple
3
C-C Tsai P.10

5
 Cycle
„ Cycle is a simple path, first and last vertices are
same.
Example: 0,1,2,0 is a cycle
0

1 2

„ Acyclic graph: no cycle is in graph

C-C Tsai P.11

Connected Components
„ Two vertices u and v are connected if they are in an
undirected graph G, ∃ a path in G from u to v.
„ A graph G is connected, if any vertex pair (u,v) is
connected
„ Connected component is a maximal connected subgraph.

„ Tree is a connected acyclic graph

Example:
A graph G with two connected components H1 and H2

0 4

2 1 5 6

3 7
H1 H2
C-C Tsai P.12

6
 Strongly Connected Components
„ u, v are strongly connected if they are in a directed
graph (digraph) G, ∃ a path in G from u to v.
„ A directed graph G is strongly connected, if any vertex
pair (u,v) is connected
0
Example 1: G3 is a strong connected graph G3
1

„ Strongly Connected Component is a maximal strongly

connected subgraph
Example 2: A graph G with two strong connected
componentsH1 and H2
0
2
H1 1
H2
C-C Tsai P.13

Degree
„ Degree of a vertex is the number of edges
incident to that vertex
G1 0 3 G2 0
2
3 1 2 3 1 2
3 3
33 3 4 5 6
1 1 1 1 0 in:1, out: 1
G3
„ Degree in directed graph 1 in: 1, out: 2
„ Indegree
„ Outdegree 2 in: 1, out: 0
„ Summation of all vertices’ degrees are 2|E|
C-C Tsai P.14

7
 The Graph Abstract Data Type
„ ADT for Graph is
objects: a nonempty set of vertices and a set of undirected edges,
where each edge is a pair of vertices
functions: for all graph ∈ Graph, v, v1 and v2 ∈ Vertices
Graph Create() ::= return an empty graph
Graph InsertVertex(graph, v) ::= return a graph with v inserted.
v has no incident edge.
Graph InsertEdge(graph, v1,v2) ::= return a graph with new edge
between v1 and v2
Graph DeleteVertex(graph, v) ::= return a graph in which v and all
edges incident to it are removed
Graph DeleteEdge(graph, v1, v2) ::=return a graph in which the
edge (v1, v2) is removed
Boolean IsEmpty(graph) ::= if (graph==empty graph) return TRUE
else return FALSE
List Adjacent(graph,v) ::= return a list of all vertices that are
adjacent to v

C-C Tsai P.15

Graph Representations
„ Adjacency Matrix
„ Adjacency Lists
„ Adjacency Multilists
„ Weighted Edge

C-C Tsai P.16

8
 Adjacency Matrix
„ Let G = (V, E) with n vertices, n ≥ 1, the adjacency
matrix of G is a 2-dimensional n × n matrix, A
„ A(i, j) = 1 iff (vi, vj) ∈E(G)
(〈vi, vj〉 for a diagraph)
„ A(i, j) = 0 otherwise.
„ The adjacency matrix for an undirected graph is
symmetric
„ The adjacency matrix for a digraph need not be
symmetric

C-C Tsai P.17

Examples of Adjacency Matrix

0 4
G1 G3 0 G4
0 2 1 5 6

1 2 3 7
1
3 ⎡0 1 1 0 0 0 0 0⎤
⎢1 0 0 1 0 0 0 0⎥⎥
0 1 2 3 2 ⎢
⎢1 0 0 1 0 0 0 0⎥
0 ⎡0 1 1 1⎤ ⎢ ⎥
⎢1 ⎡0 1 0⎤
0 1 1 ⎥⎥ ⎢0 1 1 0 0 0 0 0⎥
1
⎢ ⎢ ⎥ ⎢0
⎢1 0 1 ⎥ 0 0 0 0 1 0 0⎥
2 ⎢1 1 0 1⎥ ⎢ ⎥
⎢ ⎥ ⎢⎣0 0 0⎥⎦ ⎢0 0 0 0 1 0 1 0⎥
3 ⎣1 1 1 0⎦ ⎢0 0 0 0 0 1 0 1⎥
symmetric ⎢ ⎥
⎢⎣0 0 0 0 0 0 1 0⎥⎦
C-C Tsai P.18

9
 Merits of Adjacency Matrix
„ From the adjacency matrix, to determine the connection
of vertices is easy
„ The degree of a vertex is
n−1

∑adj_ mat[i][ j]
j =0

„ For a digraph, the row sum is the out_degree, while the

column sum is the in_degree
n −1 n −1
ind (vi ) = ∑ A[ j , i ] outd (vi ) = ∑ A[i , j ]
j =0 j =0

C-C Tsai P.19

Adjacency Lists
„ Replace n rows of the adjacency matrix with n
linked list. Each row in adjacency matrix is
represented as an adjacency list.
„ Data Structures for Adjacency Lists
#define MAX_VERTICES 50
typedef struct node *nodePointer;
typedef struct node {
int vertex;
struct node *link;
};
nodePointer graph[MAX_VERTICES];
int n=0; /* vertices currently in use */

C-C Tsai P.20

10
 Examples of Adjacency Lists
0
G1 0 G3

1 2 1
3
2
0 1 2 3
1 0 2 3 0 1
2 0 1 3 1 0 2
3 2
0 1 2

C-C Tsai P.21

Examples (Cont’d)

G4 0 1 2
0 4 1 0 3
2 0 3
2 1 5 6
3 1 2
3 7 4 5
5 4 6
6 5 7
7 6
An undirected graph with n vertices and e edges
==> n head nodes and 2e list nodes
C-C Tsai P.22

11
 Interesting Operations
„ degree of a vertex in an undirected graph
„ number of nodes in adjacency list
„ Number of edges in a graph
„ determined in O(n+e)
„ out-degree of a vertex in a directed graph
„ number of nodes in its adjacency list
„ in-degree of a vertex in a directed graph
„ traverse the whole data structure

C-C Tsai P.23

Compact Representation
0 G4 4 node[0] … node[n-1]: starting point for vertices
node[n]: n+2e+1
2 1 5 6 node[n+1] … node[n+2e]: head node of edge

3 7

[0] 9 [8] 23 [16] 2

[1] 11 0 [9] 1 4 [17] 5
[2] 13 [10] 2 5 [18] 4
[3] 15 1 [11] 0 [19] 6
[4] 17 [12] 3 6 [20] 5
[5] 18 2 [13] 0 [21] 7
[6] 20 [14] 3 7 [22] 6
[7] 22 3 [15] 1
C-C Tsai P.24

12
 Inverse Adjacency List of G3
G3
0 0

1 1

2 2

0 y 1 NULL

1 y 0 NULL

2 y 1 NULL
C-C Tsai P.25

Alternative Adjacency List of G3

tail head column link for head row link for tail

0 1 2

0 0 1 NULL NULL

1 1 0 NULL 1 2 NULL NULL

0
⎡0 1 0⎤ G3
2 NULL
⎢ ⎥
⎢1 0 1⎥ 1

⎢⎣ 0 0 0 ⎥⎦
2
C-C Tsai P.26

13
 Alternative Adjacency List of G1
G1 0

1 2
3
headnodes vertax link

0 y 3 y 1 y 2 NULL

1 y 2 y 0 y 3 NULL

2 y 3 y 0 y 1 NULL

3 y 2 y 1 y 0 NULL
C-C Tsai P.27

Adjacency Multilists
„ An edge in an undirected graph is represented by two
nodes in adjacency list representation.
„ Adjacency Multilists
„ lists in which nodes may be shared among several lists.
(an edge is shared by two different paths)

marked vertex1 vertex2 path1 path2

typedef struct edge *edgePointer;

typedef struct edge {
short int marked;
int vertex1, vertex2;
edgePointer path1, path2;
};
edgePointer graph[MAX_VERTICES];

C-C Tsai P.28

14
 Example for Adjacency Multlists
Lists: vertex 0: N0->N1->N2, vertex 1: N0->N3->N4
vertex 2: N1->N3->N5, vertex 3: N2->N4->N5

0 N0 0 1 N1 N3 edge (0,1)
1
2 N1 0 2 N2 N3 edge (0,2)
3 N2 0 3 N4 edge (0,3)
G1 0 N3 1 2 N4 N5 edge (1,2)
N0 N1
N2 N4 1 3 N5 edge (1,3)
N3
1 2
N5 2 3 edge (2,3)
N4 N5
3 six edges
C-C Tsai P.29

Weighted Edges
„ In many applications, the edges of a graph are
assigned weights
„ These weights may represent the distance from
one vertex to another
„ A graph with weighted edges is called a
network

C-C Tsai P.30

15
 Elementary Graph Operations
„ Traversal: given G = (V,E) and vertex v, find or
visit all w∈V, such that w connects v
„ Depth First Search (DFS): preorder tree traversal
„ Breadth First Search (BFS): level order tree traversal
„ Applications
„ Connected component
„ Spanning trees
„ Biconnected component

C-C Tsai P.31

Depth First Search

„ Begin the search by visiting the start vertex v
„ If v has an unvisited neighbor, traverse it recursively
„ Otherwise, backtrack
Example:
Start vertex: 0
Traverse order: 0, 1, 3, 7, 4, 5, 2, 6

1 2

3 4 5 6

7
C-C Tsai P.32

16
 Depth First Search of a Graph
#define FALSE 0
#define TRUE 1
short int visited[MAX_VERTICES];
void dfs(int v) Time complexity
{ node_pointer w; Adjacency list: O(e)
visited[v]= TRUE; Adjacency matrix:
printf(“%5d”, v); O(n2)
for (w=graph[v]; w; w=w->link)
if (!visited[w->vertex])
dfs(w->vertex);
}
C-C Tsai P.33

Breadth First Search

„ Begin the search by visiting the start vertex v
„ Traverse v’s neighbors
„ Traverse v’s neighbors’ neighbors
Example:
Start vertex: 0
Traverse order: 0, 1, 2, 3, 4, 5, 6, 7

1 2

3 4 5 6

7
C-C Tsai P.34

17
 Breadth First Search of a Graph
void bfs(int v) typedef struct queue *queuePointer;
{ nodePointer w; typedef struct queue {
queuePointer front, rear; int vertex;
front = rear = NULL; queuePointer link;
printf(“%5d”, v); };
visited[v] = TRUE; void addq(queuePointer *,
addq(&front, &rear, v); queuePointer *, int);
while (front) int deleteq(queuePointer *);
{ v= deleteq(&front);
for (w=graph[v]; w; w=w->link)
if (!visited[w->vertex])
{ printf(“%5d”, w->vertex); Time complexity
addq(&front, &rear, w->vertex); Adjacency list: O(e)
visited[w->vertex] = TRUE; Adjacency matrix:
} O(n2)
}
}
C-C Tsai P.35

Connected Component
„ Find all connected component in a graph G
„ Select one unvisited vertex v, and start DFS (or BFS) on v

„ Select one another unvisited vertex v, and start DFS (or

BFS) on v
Example:
Start on 0
„ 0, 1, 3, 4, 7 are visited
„ These 5 vertices is in the same connected component
Choose 2 void connected(void)
„ 2, 5, 6 are visited
{ for (i=0; i<n; i++)
0 { if (!visited[i])
1 2 { dfs(i); printf(“\n”);
}
3 4 5 6 }
}
C-C Tsai 7 P.36

18
 Other Applications
„ Find articulation point (cut vertex) in undirected
connected graph
„ Find bridge (cut edge) in undirected connected graph
„ Find strongly connected component in digraph
„ Find biconnected component in connected graph
„ Find Euler path in undirected connected graph
„ Determine whether a graph G is bipartite graph?
„ Determine whether a graph G contain cycle?
„ Calculate the radius and diameter of a tree

C-C Tsai P.37

Spanning Trees
„ Spanning tree: any tree consists of only edges
in G and includes all vertices in G.
Example:
G

Three possible spanning trees.

„ How many spanning trees?

C-C Tsai P.38

19
 Spanning Trees
„ Either dfs or bfs can be used to create a
spanning tree
„ When dfs is used, the resulting spanning tree is
known as a depth first spanning tree
„ When bfs is used, the resulting spanning tree is
known as a breadth first spanning tree
„ While adding a nontree edge into any spanning
tree, this will create a cycle

C-C Tsai P.39

DFS VS BFS Spanning Trees

DFS spanning tree BFS spanning tree

0 0 0

1 2 1 2 1 2

3 4 5 6 3 4 5 6 3 4 5 6

7 7 7

C-C Tsai P.40

20
 Biconnected Components
„ A spanning tree is a minimal subgraph, G’, of G such
that V(G’)=V(G) and G’ is connected.
„ Any connected graph with n vertices must have at least
n-1 edges.
„ A biconnected graph is a connected graph that has no
articulation points.

connected graph one connected graph two connected components

0 8 9 0 8 9
0 8 9

1 7 7 1 7
1
22 3 5 2 3 5 2 3 5

4 6 4 6 4 6
C-C Tsai P.41

Biconnected Components of a Graph

connected graph biconnected components

0 8 9 0 8 9

1 7 1 7 7

2 3 5 7
1

4 6 2 3 3 5 5

4 6

C-C Tsai P.42

21
 Find Biconnected Components
Depth first spanning tree 0
(dfn-depth first number)
3
1 5
4 0 9 8 9 8
4 5 Nontree edge
(back edge)
3 1 7 7
0 5 2 2 6 6
3 5 3
2 2
7 7
1
8 9
4 6
4 0 9 8
1 6
If u is an ancestor of v then dfn(u) < dfn(v).

C-C Tsai P.43

Find Biconnected Components

„ The root of a depth first spanning tree is an articulation point iff it
has at least two children.
„ Any other vertex u is an articulation point iff it has at least one
child w such that we cannot reach an ancestor of u using a path
that consists of (1) only w (2) descendants of w (3) single back
edge.
low(u)=min{dfn(u), min{low(w)|w is a
3 child of u}, min{dfn(w)|(u,w) is a back
1 5 edge}
4 5 u: articulation point low(child) ≥ dfn(u)

2 2 6 6
Vertex 0 1 2 3 4 5 6 7 8 9
3
1 7 7 dfn 4 3 2 0 1 5 6 7 9 8
8 9 low 4 0 0 0 0 5 5 5 9 8
9 8
4 0
C-C Tsai P.44

22
 Find Biconnected Components
vertex dfn low child low_child low:dfn
0 4 4 (4,n,n) null null null:4
1 3 0 (3,4,0) 0 4 4≥3 •
3 2 2 0 (2,0,n) 1 0 0<2
1 3 0 0 (0,0,n) 4,5 0,5 0,5 ≥ 0 •
5 4 1 0 (1,0,n) 2 0 0<1
4 5 5 5 5 (5,5,n) 6 5 5≥5 •
6 6 5 (6,5,n) 7 5 5<6
2 2 6 6 7 7 5 (7,8,5) 8,9 9,8 9,8 ≥ 7 •
8 9 9 (9,n,n) null null null, 9
3 9 8 8 (8,n,n) null null null, 8
1 7 7
8 9
4 0 9 8

C-C Tsai P.45

Program: Initializaiton and Determining dfn and low

void init(void)
{ for (int i = 0; i < n; i++)
{ visited[i] = FALSE;
dfn[i] = low[i] = -1;
}
num = 0;
}
void dfnlow(int u, int v)
{ node_pointer ptr;
int w;
dfn[u] = low[u] = num++;
for (ptr = graph[u]; ptr; ptr = ptr ->link)
{ w = ptr ->vertex;
if (dfn[w] < 0) /*w is an unvisited vertex */
{ dfnlow(w, u);
low[u] = MIN2(low[u], low[w]);
} else if (w != v) low[u] =MIN2(low[u], dfn[w] );
}
}
C-C Tsai P.46

23
 Program: Biconnected components of a graph
void bicon(int u, int v)
{ node_pointer ptr;
int w, x, y;
dfn[u] = low[u] = num ++;
for (ptr = graph[u]; ptr; ptr = ptr->link)
{ w = ptr ->vertex;
if ( v != w && dfn[w] < dfn[u] ) add(&top, u, w);
if(dfn[w] < 0) {
{ bicon(w, u);
low[u] = MIN2(low[u], low[w]);
if (low[w] >= dfn[u] )
{ printf(“New biconnected component: “);
do { /* delete edge from stack */
delete(&top, &x, &y);
printf(“ <%d, %d>” , x, y);
} while (!(( x = = u) && (y = = w)));
printf(“\n”);
}
} else if (w != v) low[u] = MIN2(low[u], dfn[w]);
}
}
C-C Tsai P.47

Minimum Cost Spanning Tree

„ The cost of a spanning tree of a weighted undirected
graph is the sum of the costs of the edges in the
spanning tree. A minimum cost spanning tree is a
spanning tree of least cost
Example:

Select n-1 edges from a weighted graph

of n vertices with minimum cost.

C-C Tsai P.48

24
 Greedy Strategy
„ An optimal solution is constructed in stages
„ At each stage, the best decision is made at this time
„ Since this decision cannot be changed later,
we make sure that the decision will result in a feasible
solution
„ Typically, the selection of an item at each
stage is based on a least cost or a highest profit
criterion
„ Three different algorithms can be used
„ Kruskal & Prim
„ Prim
„ Sollin

C-C Tsai P.49

Kruskal’s and Prim’s algorithm for

MST
„ An optimal solution is constructed in stages
Step 1: Sort all edges into nondecreasing order.
Step 2: Add the next smallest weight edge to the forest if
it will not cause a cycle.
Step 3: Stop if n-1 edges. Otherwise, go to Step2.
T= {};
while (T contains less than n-1 edges && E is not empty)
{ choose a least cost edge (v,w) from E;
delete (v,w) from E;
if ((v,w) does not create a cycle in T) add (v,w) to T
else discard (v,w);
}
if (T contains fewer than n-1 edges) printf(“No spanning tree\n”);
„ Time complexity: O(|E| log |E|)
C-C Tsai P.50

25
 Example of Kruskal’s and Prim’s
algorithm

C-C Tsai P.51

Prim’s Algorithm
Step 1: x ∈ V, Let A = {x}, B = V - {x}.
Step 2: Select (u, v) ∈ E, u ∈ A, v ∈ B such that (u, v) has
the smallest weight between A and B.
Step 3: Put (u, v) in the tree. A = A ∪ {v}, B = B - {v}
Step 4: If B = ∅, stop; otherwise, go to Step 2.

T={}; TV={0};
while (T contains fewer than n-1 edges)
{ let (u,v) be a least cost edge such that u∈TV and v∉TV
if (there is no such edge ) break;
add v to TV; add (u,v) to T;
}
if (T contains fewer than n-1 edges) printf(“No spanning tree\n”);

„ Time complexity : O(|V|2)

C-C Tsai P.52

26
 Example of Prim’s Algorithm

C-C Tsai P.53

Sollin’s Algorithm
„ Unlike Kruskal’s and Prim’s algorithms, Sollin’ algorithm
selects multiple edges at each stage.
„ At the start of a stage, the selected edges and all the n
vertices form a spanning forest.
„ During each stage, an minimum-cost edge is selected
for each tree in the forest.
„ It’s possible that two trees in the forest to select the
same edge. Only one should be used.
„ Also, it’s possible that the graph has multiple edges with
the same cost. So, two trees may select two different
edges that connect them together. Again, only one
should be retained.

C-C Tsai P.54

27
 Example: Sollin’s Algorithm

0
28
vertex edge
10 1 0 0 -- 10 --> 5, 0 -- 28 --> 1
14 16 1 1 -- 14 --> 6, 1-- 16 --> 2, 1 -- 28 --> 0
2 2 -- 12 --> 3, 2 -- 16 --> 1
5 6 2 3 3 -- 12 --> 2, 3 -- 18 --> 6, 3 -- 22 --> 4
24 4 4 -- 22 --> 3, 4 -- 24 --> 6, 5 -- 25 --> 5
25
18 12 5 5 -- 10 --> 0, 5 -- 25 --> 4
4 6 6 -- 14 --> 1, 6 -- 18 --> 3, 6 -- 24 --> 4
22
3

C-C Tsai P.55

Sollin’s Algorithm (con.)

0 0 {0,5} 0
28
1 10 1 5 25 4 0 1 10 1
14 14 16
{1,6}
5 6 2 5 6 2 5 6 2
28
1 16 2 1 0
12 12
4 4 24 4
18 6 4
6 3 22
3 22 3 3

C-C Tsai P.56

28
 Shortest Paths and Transitive
Closure
„ Given a directed graph G=(V,E), a weighted
function, w(e).
„ How to find the shortest path from u to v?
„ Single source all destinations:
„ Nonnegative edge costs: Dijkstra’s algorithm
„ General weights: Bellman-Ford’s algorithm
„ All pairs shortest path
„ Floyd’s algorithm

C-C Tsai P.57

Single Source All Destinations:

Nonnegative Edge Costs
„ Given a directed graph G=(V,E), a weighted
function, w(e), and a source vertex v0
„ We wish to determine a shortest path from v0
to each of the remaining vertices of G

C-C Tsai P.58

29
 Dijkstra’s algorithm
„ Let S denotes the set of vertices, including v0, whose
shortest paths have been found.
„ For w not in S, let distance[w] be the length of the
shortest path starting from v0, going through vertices
only in S, and ending in w.
„ We can find a vertex u not in S and distance[u] is
minimum, and add u into S.
„ Maintain distance properly
„ Complexity: (|V|2)

C-C Tsai P.59

Example: Dijkstra’s algorithm

1 2 3 4 5 6 7 8
1 0
2 300 0 Cost adjacency
matrix. All entries
3 1000 800 0 not shown are +∞.
4 1200 0
5 1500 0 250
6 1000 0 900 1400
7 0 1000
8 1700 0
C-C Tsai P.60

30
 Iteration S Selected (1) (2) (3) (4) (5) (6) (7) (8)
Initial ----
1 5 6 +∞ +∞ +∞ 1500 0 250 +∞ +∞
2 5,6 7 +∞ +∞ +∞ 1250 0 250 1150 1650
3 5,6,7 4 +∞ +∞ +∞ 1250 0 250 1150 1650
4 5,6,7,4 8 +∞ +∞ 2450 1250 0 250 1150 1650
5 5,6,7,4,8 3 3350 +∞ 2450 1250 0 250 1150 1650
6 5,6,7,4,8,3 2 3350 3250 2450 1250 0 250 1150 1650
5,6,7,4,8,3,2 3350 3250 2450 1250 0 250 1150 1650
C-C Tsai P.61

All Pairs Shortest Paths

„ Given a directed graph G=(V,E), a weighted
function, w(e).
„ How to find every shortest path from u to v for
all u,v in V?

C-C Tsai P.62

31
 Floyd’s Algorithm
„ Represent the graph G by its length adjacency matrix
with length[i][j]
„ If the edge <i, j> is not in G, the Represent the graph G
by its length adjacency matrix with length[i][j] is set to
some sufficiently large number
„ Ak[i][j] is the Represent the graph G by its length
adjacency matrix with length of the shortest path form i
to j, using only those intermediate vertices with an
index ≤ k
„ Complexity: O(|V|3)

C-C Tsai P.63

Ak[i][j]
„ A-1[i][j] = length[i][j]
„ Ak[i][j] = the length (or cost) of the shortest
path from i to j going through
no intermediate vertex of index greater than k
= min{ Ak-1[i][j], Ak-1[i][k]+Ak-1[k][j] } k≧0

C-C Tsai P.64

32
 Example: Floyd’s Algorithm

6
A-1 0 1 2
v0 v1 0 0 4 11
4
11
1 6 0 2
3 2
2 3 ∞ 0
v2
6

v0 v1 A0 0 1 2
4 0 0 4 11
11 1 6 0 2
3 2
v2 2 3 7 0

C-C Tsai P.65

Example cont.
6
A1 0 1 2
v0 v1 0 0 4 6
4
11 1 6 0 2
3 2
2 3 7 0
v2

6
A2 0 1 2
v0 v1 0 0 4 6
4
11 1 5 0 2
3 2
2 3 7 0
v2
C-C Tsai P.66

33
 Activity Networks
„ We can divide all but simplest projects into
several subprojects called activity.
„ Model it as a graph
„ Activity-on-Vertex (AOV) Networks
„ Activity-on-Edge (AOE) Networks

C-C Tsai P.67

Activity on Vertex (AOV) Networks

„ An activity on vertex, or AOV network, is a directed
graph G in which the vertices represent tasks or
activities and the edges represent the precedence
relation between tasks
Example: C3 is C1’s successor, C1 is C3’s predecessor

C9
C8
C1 C10 C11
C3 C7
C2 C12

C13 C14

C4 C5 C6
C15
C-C Tsai P.68

34
 Topological Ordering
„ A topological order is a linear ordering of the
vertices of a graph such that, for any two vertices i and
j, if i is a predecessor of j in the network then i
precedes j in the ordering
Example: C1 C2 C4 C5 C3 C6 C8 C7 C10 C13 C12 C14 C15 C11 C9
„ May not unique
C9
C8
C1 C10 C11
C3 C7
C2 C12

C13 C14

C4 C5 C6

C15
C-C Tsai P.69

Topological Sort
Step1: Find a vertex v such that v has no predecessor,
output it. Then delete it from network
Step2: Repeat this step until all vertices are deleted
„ Time complexity: O(|V| + |E|)

for (i = 0; i <n; i++)

{ if every vertex has a predecessor
{ fprintf(stderr, “Network has a cycle.\n “ ); exit(1);}
pick a vertex v that has no predecessors;
output v;
delete v and all edges leading out of v from the
network;
}
C-C Tsai P.70

35
 Example
„ v0 has no predecessor, output it. Then delete it and
three edges
v1 v1

v0 v2 v4 v0 v2 v4

v3 v5 v3 v5

„ Choose v3, output it v1

„ Final result: v0, v3, v2, v1, v4, v5
v2 v4

v3 v5
C-C Tsai P.71

Issues in Data Structure Consideration

„ Decide whether a vertex has any predecessors.
„ Each vertex has a count.

„ Decide a vertex together with all its incident edges.

„ Adjacency list

C-C Tsai P.72

36
 Issues in Data Structure Consideration
„ Decide whether a vertex has any predecessors.
„ Each vertex has a count.

„ Decide a vertex together with all its incident edges.

„ Adjacency list

headnodes node
count link vertex link
V0 0 y 1 y 2 y 3 NULL

V1 1 y 4 NULL

V2 1 y 4 y 5 NULL

V3 1 y 5 y 4 NULL
v1
V4 3 NULL
v0 v2 v4
V5 2 NULL
v3 v5
C-C Tsai P.73

Declaration
„ typedef struct node *node_pointer;
typedef struct node {
int vertex;
node_pointer link;
};
typedef struct {
int count;
node_pointer link;
} hdnodes;
hdnodes graph[MAX_VERTICES];

C-C Tsai P.74

37
 Topological Sort
void topsort (hdnodes graph [] , int n)
{ int i, j, k, top; node_pointer ptr;
/* create a stack of vertices with no predecessors */
top = -1;
for (i = 0; i < n; i++)
if (!graph[i].count)
{ graph[i].count = top; top = i; }
for (i = 0; i < n; i++)
if (top == -1)
{ fprintf (stderr, “\n Network has a cycle. Sort terminated. \n”); exit(1);
} else
{ j = top; /* unstack a vertex */
top = graph[top].count;
printf(“v%d, “, j);
for (ptr = graph [j]. link; ptr ;ptr = ptr ->link )
{ /*decrease the count of the successor vertices of j*/
k = ptr ->vertex;
graph[k].count --;
if (!graph[k].count) /* add vertex k to the stack*/
{ graph[k].count = top; top = k; }
}
}
}
C-C Tsai P.75

Activity on Edge (AOE) Networks

„ AOE network is an activity network closely related to the AOV
network. The directed edges in the graph represent tasks or
activities to be performed on a project.
„ Directed edge: tasks or activities to be performed
„ Vertex: events which signal the completion of certain activities
„ Number: time required to perform the activity
Example: Activities: a0, a1,… Events: v0,v1,…
V1 V6
a0 = 6 a3 = 1 a6 = 9 a9 = 2

start V0 V4 V8 finish
a1 = 4
a4 = 1 a7 = 7 a10 = 4
V2 V7

a2 = 5 a8 = 4
a5 = 2
V3 V5
C-C Tsai P.76

38
 Applications of AOE Network
„ Evaluate performance
„ minimum amount of time
„ activity whose duration time should be shortened
„ …
„ Critical path
„ a path that has the longest length
„ minimum time required to complete the project
„ …

C-C Tsai P.77

Critical Path
„ A critical path is a path that has the longest
length. (v0, v1, v4, v7, v8)

V1 V6
a0 = 6 a3 = 1 a6 = 9 a9 = 2

start V0 V4 V8 finish
a1 = 4
a4 = 1 a7 = 7 a10 = 4
V2 V7

a2 = 5 a8 = 4
6 + 1 + 7 + 4 = 18 (Max)
a5 = 2
V3 V5

C-C Tsai P.78

39
 Earliest Time
„ The earliest time of an activity, ai, can occur is the length of the
longest path from the start vertex v0 to ai’s start vertex.
（Ex: the earliest time of activity a7 can occur is 7.）
„ We denote this time as early(i) for activity ai.
∴ early(6) = early(7) = 7.

V1 V6
a0 = 6 a3 = 1 a6 = 9 a9 = 2
0/? 6/? 7/? 16/?
start V0 V4 V8 finish
a1 = 4 4/? 7/? 14/?
18
0/? a4 = 1 a7 = 7 a10 = 4
V2 V7

0/?
a2 = 5 a8 = 4 7/?
a5 = 2
V3 V5
5/?
C-C Tsai P.79

Latest Time
„ The latest time, late(i), of activity, ai, is defined to be the latest time the
activity may start without increasing the project duration.
„ Ex: early(5) = 5 & late(5) = 8; early(7) = 7 & late(7) = 7

V1 V6
a0 = 6 a3 = 1 a6 = 9 a9 = 2
0/0 6/6 7/7 16/16
start V0 V4 V8 finish
a1 = 4 4/5 7/7 14/14
0/1 a4 = 1 a7 = 7 a10 = 4
V2 V7

0/3
a2 = 5 a8 = 4 7/10
late(5) = 18 – 4 – 4 - 2 = 8
a5 = 2 late(7) = 18 – 4 – 7 = 7
V3 V5
5/8

C-C Tsai P.80

40
 Critical Activity
„ A critical activity is an activity for which early(i) =
late(i).
„ The difference between late(i) and early(i) is a
measure of how critical an activity is.

Calculation
of
Earliest Times
Finding To solve
Calculation Critical path(s) AOE Problem
of
Latest Times

C-C Tsai P.81

Calculation of Earliest Times

„ Let activity ai is represented by edge (u, v).
„ early (i) = earliest [u]
„ late (i) = latest [v] – duration of activity ai

vu ai vv
„ We compute the times in two stages:
a forward stage and a backward stage.
„ The forward stage:
„ Step 1: earliest [0] = 0
„ Step 2: earliest [j] = max {earliest [i] + duration of (i, j)}
i is in P(j)

P(j) is the set of immediate predecessors of j.

C-C Tsai P.82

41
 Computing Earliest from Topological Sort

V1 V6
6 1 9 2

V0 V4 V8
4
1 7 4
V2 V7

5 4
2
V3 V5

C-C Tsai P.83

Calculation of Latest Times

„ The backward stage:
„ Step 1: latest[n-1] = earliest[n-1]
„ Step 2: latest [j] = min {latest [i] - duration of (j, i)}
i is in S(j)
S(j) is the set of vertices adjacent from vertex j.
latest[8] = earliest[8] = 18
latest[6] = min{earliest[8] - 2} = 16
latest[7] = min{earliest[8] - 4} = 14
latest[4] = min{earliest[6] – 9; earliest[7] – 7} = 7
latest[1] = min{earliest[4] - 1} = 6
latest[2] = min{earliest[4] - 1} = 6
latest[5] = min{earliest[7] - 4} = 10
latest[3] = min{earliest[5] - 2} = 8
latest[0] = min{earliest[1] – 6; earliest[2] – 4; earliest[3] – 5} = 0

C-C Tsai P.84

42
 Computing Latest from Topological Sort

V1 V
6 1 9 6 2

V0 V V8
4 4
1 7 4
V2 V
7

5 4
2
V3 V
5

C-C Tsai P.85

Graph with non-critical activities deleted

V1 V6 Activity Early Late L-E Critical

a0 a3 a6 a9
a0 0 0 0 Yes

V0 V4 V8 a1 0 2 2 No
a1
start V2 V7 finish a2 0 3 3 No
a4 a7 a10 a3 6 6 0 Yes

a2 a4 4 6 2 No

V3 V5 a8 a5 5 8 3 No

a5 a6 7 7 0 Yes

a7 7 7 0 Yes

a8 7 10 3 No

a9 16 16 0 Yes

a0 V1 a3 a6 V6 a9 a10 14 14 0 Yes

start V0 V4 V8 finish

a7 V7 a10
C-C Tsai P.86

43