Design & Analysis of Algorithms

Graph Theoretic Concepts

Handout-12
What is a graph?
• A set of vertices (or nodes) linked by edges

1
3

2 5
4
• Mathematically, we often write G = (V,E)
 V: set of vertices, so |V| = number of vertices
 E: set of edges, so |E| = number of edges
Graphs
• A graph G (sometimes called networks) consists of
two things:
(i) A set V = V(G) whose elements are called vertices,
points, or nodes of G.
(ii) A set E = E(G) of unordered pairs of distinct
vertices called edges of G.
• Vertices “u” and “v” are said to be adjacent if there is
an edge e = {u, v} joining them.
• the edge “e” is said to be incident on each of its
vertices u and v.

3
Example of a graph

4
Examples

1. Vertex set = {v1, v2, v3, v4, v5, v6}

2. Edge set = {e1, e2, e3, e4, e5, e6, e7} e7
3. e1, e2, and e3 are incident on v1 v6

4. v2 and v3 are adjacent to v1 v4 e5

5. e2,, e3 and e4 are adjacent to e1
6. e6 and e7 are loops v5
v1
e6
7. e2 and e3 are parallel
e1 e2 e3
8. v5 and v6 are adjacent to themselves
9. v4 is an isolated vertex v2 v3
e4
10. Endpoint(e5) = (v5, v6)
Degree of vertices in a graph
• The degree of a vertex “v” in a graph G, written deg
(v), is equal to the number of edges in G incident on a
vertex “v”.
• Each edge is counted twice in counting the degrees of
the vertices of G.
• Therefore, sum of the degrees of the vertices of a
graph G is equal to twice the number of edges in G.
• A vertex is said to be even or odd according as its
degree is an even or an odd number. A vertex of
degree zero is called an isolated vertex.

6
Various types of graphs
• Connected/disconnected graphs

• The circled subgraphs are also known as connected

components
Various types of graphs
• Weighted/unweighted graphs

5
0 -2

• You may treat unweighted edges to be weighted

edges of equal weights
Multigraphs
• The edges “e4” and “е5” are called multiple edges
since they connect the same endpoints, and the edge
“e6” is called a loop since its endpoints are the
same single vertex.

9
Complete, regular and bipartite graphs
• A graph G is said to be complete if every vertex in G
is connected to every other vertex in G.
A graph G is regular of degree k or k-regular if every
vertex has degree k. (I.e every vertex has equal
number of edges)
• A graph G is said to be bipartite if its vertices V can
be partitioned into two subsets M and N such that
each edge of G connects a vertex of M to a vertex of
N.
• By a complete bipartite graph, we mean that each
vertex of M is connected to each vertex of N.

10
Graphs.G1

Graphs.G2

Graph G1 is complete, 3-regular and G2 bipartite

graphs
11
Directed(digraphs)/undirected graphs

• You may treat each undirected edge as two directed

edges in opposite directions
Directed graphs or digraphs
• Directed graphs are graphs in which the edges are
one-way or arrows. A directed graph G or digraph
consists of two things:
• (i) A set V whose elements are called vertices, nodes,
or points.
• (ii) A set of ordered pairs (u, v) of vertices called arcs
or directed edges.

14
Directed graphs

15
Degrees of digraph
• The outdegree of a vertex v of G, written outdeg(v), is
the number of arcs beginning at v, and the indegree of
v, written indeg(v), is the number of arcs ending at v.
each arc begins and ends at a vertex.
• Theorem: The sum of the outdegrees of the vertices
of a digraph G equals the sum of the indegrees of the
vertices, which equals the number of edges in G.

16
 Adjacency matrix of digraph

X Y Z W
No. of 1’s in A is X
equal to no. of Y
edges, row total Z
and col. Gives the W
indegree and
outdegree, resp. 17
Adjacency list
In graph theory, an adjacency list is the representation of all edges or arcs in
a graph as a list.
Connectivity of digraphs
• There are three types of connectivity in a directed graph G:
• (i) G is strongly connected or strong if, for any pair of vertices
u and v in G, there is a path from u to v; and a path from v to
u, that is, each is reachable from the other.
• (ii) G is unilaterally connected or unilateral if, for any pair of
vertices u and v in G, there is a path from u to v or a path from
v to u, that is, one of them is reachable from the other.
• (iii) G is weakly connected or weak if there is a undirected
path between any pair of vertices u and v in G.

19
Digraphs and relations
• The relation R is reflexive if every node has a loop.
• The relations R is symmetric if arcs are bidirectional.
• The relation R is transitive if for any sequence of
consecutive arcs, there is a single arc from the first to
the last node.

20
Digraphs and relations

21
Paths and connectivity
• A path in a graph G consists of an alternating sequence
of vertices and edges of the form;
v0, e1, v1, e2, v2, ………., en-1, vn-1 , еn, vn
• where each edge ei contains the vertices vi-1 and vi
(which appear on the sides of edge ei in the sequence).
• The path is said to be closed if v0 = vn. Otherwise, we say
the path is from v0 to vn, or between v0 and vn, or
connects v0 to vn. A simple path is a path in which all
vertices are distinct.
• Length of a path is the number of edges in the path.
• A graph G is connected if there is a path between any two
of its vertices
22
Trees
 Family Tree
Q uresh

G halib M uh arib

T aiem Luayy

A uf Ka'ab A m ir H irs

H u sa is S ehm M urrah Ja m ha A di

T aiem Kilab M akh zo om

Z ah ra Q usayy

M ug hee ra Abd Munaf A b du d D ar A b du l U za

M utlib A b du s S ha m s N au fil Hashim A bu A m r A bu Ub aida

A sad N uzlah Abdul M utlib A ba ' S aifi

H a ris Z u ba ir A bu T alib Abdullah M usa'ab A bu La hab M aq oom H a jl A bb as M ug hee ra H a m za Z a rrar

M uham m ad
(PBUH)
 Tree - Definition
A tree is a finite set of one or more nodes such that:
1. There is a specially designated node called the root.
2. The remaining nodes are partitioned in n  0 disjoint sets T1, T2, …, Tn, where each of
these sets is a tree.
3. T1, T2, …, Tn are called the sub-trees of the root.
 Family Tree
Sub-trees

Q uresh root

G halib M uh arib

T aiem Luayy

A uf Ka'ab A m ir H irs

H u sa is S ehm M urrah Ja m ha A di

T aiem Q ulaab M akh zo om

Banu Hashim
Z ah ra Q usayy

M ug hee ra Abd Munaf A b du d D ar A b du l U za

M utlib A b du s S ha m s N au fil Hashim A bu A m r A bu Ub aida

A sad N uzlah Abdul M utlib A ba ' S aifi

H a ris Z u ba ir A bu T alib Abdullah M usa'ab A bu La hab M aq oom H a jl A bb as M ug hee ra H a m za Z a rrar

M uham m ad
(PBUH)
Tree

B F K

C H D L X

Q G M I N P
Node Types
A

B F K

C H D L X

Q G M I N P

Root (no parent)

Intermediate nodes (has a parent and at least one child)

Leaf nodes (0 children)

Degree of a Node
Number of Children

B F K

C H D L X

Q G M I N P

Degree 1 Degree 3

Degree 0 Degree 2
Level of a Node
Distance from the root
A

B F K

C H D L X

Q G M I N P

Level 0 Level 2

Level 1 Level 3

Height of the Tree = Maximum Level + 1

Examples of Binary Trees

A A

B K B

C H L X C

Q M P Q

M
Properties of Binary Trees
• The maximum number of nodes on level i of a binary
tree is 2i
• The maximum number of nodes in a binary tree of
height k is 2k – 1
 Full Binary Tree
A binary tree of height k having 2k – 1 nodes is called a full
binary tree

2 3

4 5 6 7

8 9 10 11 12 13 14 15
 Complete Binary Tree
A binary tree that is completely filled, with the possible
exception of the bottom level, which is filled from left to right, is
called a complete binary tree

2 3

4 5 6 7

8 9 10 11 12
 Binary Tree Traversal
In Order Traversal (LNR)

B K

C H L X if (t) {
InOrder(t->left);
Q M P
visit(t);
InOrder(t->right);
Q C M B H A L K X P }
 Binary Tree Traversal
Pre Order Traversal (NLR)

B K

C H L X if (t) {
visit(t);
Q M P
PreOrder(t->left);
PreOrder(t->right);
A B C Q M H K L X P }
 Binary Tree Traversal
Post Order Traversal (LRN)

B K

C H L X if (t) {
PostOrder(t->left);
Q M P
PostOrder(t->right);
visit(t);
Q M C H B L P X K A }
 Binary Tree Traversal
A

B K

C H L X

Q M P

NLR – visit when at the left of the Node A B C Q M H K LX P

LNR – visit when under the Node Q C M B H A L KX P

LRN – visit when at the right of the Node Q M C H B L P XK A

 Expression Tree
-

+ /

A * D *

B C E F

LNR: A+B*C-D/E*F
NLR: -+A*BC/D*EF
LRN: ABC*+DEF*/-
BinaryTree ::~ BinaryTree();

Which Algorithm?

Delete both the left child and right child

before deleting itself

LRN