0% found this document useful (0 votes)
30 views20 pages

Minimum Spanning Tree 01

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views20 pages

Minimum Spanning Tree 01

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

MINIMUM

SPANNING
TREE
Operation Research 1
Minimum SPANNING TREE

Department Mathematics: Undergraduate Program


Course Code: MAT1211
3 Credits
Faculty of Mathematics and Natural Sciences
Citra Dewi Hasibuan, S.Si., M.Sc.
kelas.usu.ac.id

RPS Attandence Assignment


TOPIC

Minimum Spanning Tree


LEARNING OUTCOMES

Sub CPMK 8
Mampu menerapkan konsep model
minimum spanning tree. (C3)
CONTENTS

Kruskal’s
01 Brainstorming 04 Algorithm

02 Introduction 05 Problem Discussion

Minimum Spanning
03 Tree 06 Conclusion
Review
What we have learned before mid test ? Fill your answer
in this platform

Mentimeter
2405 4126
Brainstorming

Problem Based Learning:


You are a network planner for a
telecommunication company
responsible for connecting
remote villages in North
Sumatra with a new fiber optic
cable network. Central office

Your goal is to provide the most


cost-effective connection
possible while ensuring all
villages are connected.
Brainstorming Cabling: Naïve Approach

Are all villages connected?

Is this the most cost-effective


connection possible?
Central office

Expensive!
Brainstorming Wiring: Better Approach

How to make the most cost-effective


connection possible?
Central office
Brainstorming

6
3 G
5 F
3 2 3 4
D

3 C
6 4 3
3
2 Central Office
7
2
A 1
B
8
H 2 I 5 J
Introduction
Connected Network & Spanning Tree

Two nodes are connected if the network contains at


least one path between them.
A connected network is a network where every pair of
nodes is connected.
A path that begins and ends at the same node is called
a cycle.
For a network with n nodes, a spanning tree is a group
of n -1 arcs that connects all nodes of the network and
contains no cycles.
B
EXAMPLE C & D connected; C & G not connected.
D F
E No Cycle.
A
Not a spanning tree n=7, n-1 = 6.
C G Number of arcs = 5.

C & D connected; C & G connected.


Cycles: C-A-B-D-C; E-F-G-E
Not a spanning tree n=7, n-1 = 6.
Number of arcs = 8.

C & D connected; C & G not connected.


No Cycle
Is a spanning tree n=7, n-1 = 6.
Number of arcs = 6.
Minimum Spanning Trees

Given some nodes, the potential undirected arcs, and their


lengths.
Design the network by identifying enough arc so there is a path
between every pair of nodes and the total length of these arcs is
minimum.
Kruskal’s Algorithm

Work with edges.


Two steps:
Sort edges by increasing edge
weight.
Select the first |V| -1 edges
that do not generate a cycle.
Walk through:
Kruskal’s Algorithm
Select first |V|–1 edges which do not generate a cycle

Not
considered

Total Cost = 21
GROUP DISCUSSION
E
Problem Based Learning:
6
3 G
You are a network planner for a
5 F
telecommunication company 3 2 3 4
responsible for connecting remote D
villages in North Sumatra with a new C
3 6 4 3
fiber optic cable network. 3
Your goal is to provide the fastest and 2 Central Office
most cost-effective connection possible 7
2
while ensuring all villages are connected. A 1
Find the Minimum Spanning Tree (MST) B
8
and find the weight with Kruskal’s H 2 I 5 J
Algorithm!
Conclusion
Quiz

Find the Minimum Spanning


Tree (MST) and find the weight
with Kruskal’s Algorithm!
REFERENCE

Hamdy A. Taha ( 2017) Hilllier , Lieberm (2015)


Operation Research Introduction To Operation
An Introduction Research
Shortest Route
Problem
“The end of education is character.”
Sathya Sai Baba

You might also like