Please enable JavaScript.
Coggle requires JavaScript to display documents.
Topic 3: Network Models - Coggle Diagram
Topic 3: Network Models
Topic Outline
- Minimal-Spanning Tree Problem
-
-
-
-
-
Minimal Spanning-Tree technique determines a path through a network that connects all the points while minimizing total distance
-
-
- Minimal Spanning Tree Technique
The Launderdale Construction Company is developing a housing project. It wants to determine the least expensive way to provide power and water to each house. There are eight houses in the project and the distance is shown
-
The Minimal Spanning Tree Technique involves connecting all the points of the network together while minimizing distance between them
-
Step 3: Considering all the nodes are now connected, find and connect the nearest node that is not connected. If there is a tie, select one of them. A tie means there may be more than one optimal solution
-
3.Maximal Flow Technique
Maximal Flow Technique allow us to determine the the maximum amount of material that can flow through a network
-
-
Step 2: Find the arc on this path with the smallest flow capacity available. This represents the maximum additional capacity that can be allocated to this route
-
Step 3: For each node in this path, decrease the flow capacity in the direction of the flow by the amount of capacity. For each node on the path, increase the flow capacity in the reverse direction by the amount of capacity
-
Step 2: Find the next-nearest node to the origin and put the distance in the box by the node. Several path may have to be checked in order to find the nearest node
Repeat this process until you have gone through the entire network. The last distance at the ending node will be a distance of the shortest route
-