NETWORK MODELS

NETWORKS MODELS
A network is an arrangement of

paths (branches) connected at

various points (nodes) through which
one or more items move from one point
to another.
The network is drawn as a diagram

providing a picture of the system, thus

enabling visual representation and
enhanced understanding.

NETWORKS MODELS
A real-life systems can be

modeled as networks
The Shortest Route Problem
The Minimal Spanning Tree

Problem
The Maximal Flow Problem

The Shortest Route Problem

Examples of shortest path

problems:
a. airline scheduling
b. equipment replacement
c. routing in telecommunications
networks
d. reliability problems
e. traffic routing

The Maximal Flow Problem

In

the maximum flow

problem our goal is to send
the largest amount of flow
possible from a specified
origin node to a specified
destination node subject to
arc capacities.

The Minimal Spanning Tree

A tree is a

graph
loops.

connected undirected
that has no cycles/ no

A spanning tree for a graph is a

sub graph that includes

nodes of the original.

every

A minimum spanning tree, (MST)

is a sub graph whose sum of edge

weights is minimized.

The Minimal Spanning Tree Problem

Problem: Each node in a network

represents a computer in a
computer network, arc(i,j) might
represent an underground cable
that connects computer i to
computer j.
Connect all nodes in a network so
that the total of the arc lengths
are minimized.

STEPS:
1. Select any starting node.
2. Select the node closest to the

starting node to join the spanning

tree.
3. Select the closest node not

currently in the spanning tree.

4. Repeat step 3 until all nodes have

joined the spanning tree.

EXAMPLE:
A company has seven computers.

The distances between computers

are given in the figure below. What is
the minimum length of cable
required
to
interconnect
the
computers?

Solution:
step 1

Copyright 2013
Pearson Education, Inc.
Publishing as Prentice
Hall

Solution:
step 2

Copyright 2013
Pearson Education, Inc.
Publishing as Prentice
Hall

Solution:
Continue
to select the closest node not presently in the
step 3
spanning area.

Copyright 2013
Pearson Education, Inc.
Publishing as Prentice
Hall

Solution:
step 4

Copyright 2013
Pearson Education, Inc.
Publishing as Prentice
Hall

Solution:
step 5

Copyright 2013
Pearson Education, Inc.
Publishing as Prentice
Hall

Solution:
Optimal
step Solution
6

Copyright 2013
Pearson Education, Inc.
Publishing as Prentice
Hall

Minimum length = 72

A pipeline is to be built that will link six cities. The

cost (in millions) of constructing each potential
link depends on distance and terrain as shown in
the weighted graph in figure below. Find a system
of pipelines to connect all the cities and yet
minimize the total cost.
Lipis

60

Bentong

Kuantan

33
Raub
160

260
50

100

136

230
Rompin
90

Temerloh
Pekan

130

85
Maran