Professional Documents
Culture Documents
NETWORKS MODELS
A network is an arrangement of
NETWORKS MODELS
A real-life systems can be
modeled as networks
The Shortest Route Problem
The Minimal Spanning Tree
Problem
The Maximal Flow Problem
graph
loops.
connected undirected
that has no cycles/ no
every
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
EXAMPLE:
A company has seven 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
60
Bentong
Kuantan
33
Raub
160
260
50
100
136
230
Rompin
90
Temerloh
Pekan
130
85
Maran