SESSION 12

Computer Networks and Applications

GRAPH THEORY
 A Graph is a collection of points called vertices
and lines called edges.
 Symbolically, G = (N,A)
 N : Set of nodes, points, vertices
 A : Set of arcs, lines, edges

2
1
3
4
5

N = (1,2,3,4,5)
A = { (1,2), (1,4), (1,5), (2,3), (3,4), (4,5) }
Directed vs. undirected graph

undirected graph: (1,2) same as (2,1)

directed graph (DIGRAPH):

each arc has a direction
TREE AND SPANNING TREE
 A Tree is an acyclic Graph : No Cycles
 A Spanning Tree is a connected Tree.

 A Spanning Tree connects any two nodes with a unique

path.
APPLICATIONS OF MST
 Given a graph with edge weights, wij, find a spanning tree so that
total weight is minimized.
 Applications:
 Minimum cost road/telecom networks, when
a) Capacity is not an issue.
b) Total distance traveled is not an issue.
c) Minimal connectivity is to be provided at least cost.

 Rural Road Network

 Pipeline Network
 Electrical Power Grid
 Telecom Backbone Network
MINIMAL SPANNING TREE ALGORITHM
 Sort all edges by weight in increasing order.
 Examine all edges in sequence, starting from the smallest.

 If the edge does not form a cycle with the edges already
included in the tree, include it in the tree, otherwise
discard it.
 Continue with the remaining edges until the tree is
complete, i.e. n-1 edges have been selected.
 DEL

JPR AGR LKO

JDH
VAR
GWL

BHP
Partial list of sorted distances:

150 DEL-AGR
180 AGR-GWL
200 JPR-JDH
250 GWL-BHP
260 DEL-JPR
270 AGR-JPR
290 LKO-VAR
310 DEL-GWL
320 JPR-GWL
350 AGR-LKO
400 JPR-BHP
450 DEL-LKO
460 DEL-JDH