Scribd
Upload
34 views5 pages

Traffic Assignment

The document compares and contrasts minimum spanning trees and critical paths. It then provides more details about Dijkstra's algorithm, which can be used to find the critical path between two nodes in a weighted graph. The response summarizes that Dijkstra's algorithm determines the critical path between nodes 1 and 15 is nodes 1-4-7-9-11-15, with a total distance of 19 units. It also determines the minimum spanning tree considering source node 1 connects all nodes at a minimum total distance of 59 units.

Uploaded by

Anirban Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
34 views5 pages

Traffic Assignment

The document compares and contrasts minimum spanning trees and critical paths. It then provides more details about Dijkstra's algorithm, which can be used to find the critical path between two nodes in a weighted graph. The response summarizes that Dijkstra's algorithm determines the critical path between nodes 1 and 15 is nodes 1-4-7-9-11-15, with a total distance of 19 units. It also determines the minimum spanning tree considering source node 1 connects all nodes at a minimum total distance of 59 units.

Uploaded by

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

 DIFFERENCE BETWEEN MINIMUM SPANNING TREE AND CRITICAL PATH:

MINIMUM SPANNING TREE CRITICAL PATH

One source node, connects all nodes with To find shortest path between two nodes
the minimum network length. only.

Prim's algorithm and Kruskal's algorithm Djisktra’s algorithm is one of the popular
are popular methods for finding the method for finding the critical (shortest)
minimum spanning tree. path.

Minimum spanning tree is commonly Critical Path is primarily used in project


used in computer networks, scheduling and management to identify
transportation networks, and other the tasks that must be completed on time
connectivity-related problems. to ensure the project finishes on
schedule.
 DJIKSTRA’S ALGORITHM :

Dijkstra's algorithm, named after Dutch computer scientist Edsger W. Dijkstra, is a graph search algorithm that finds
the shortest path between two nodes in a weighted graph. The algorithm is often used in routing and as a
subroutine in other graph algorithms. Dijkstra's algorithm works well for finding the shortest paths in graphs where
all edge weights are non-negative.

 Use of Dijkstra's algorithm in logistics :

 Find shortest route(s) between multiple delivery points.


 Optimize allocation of resources (fleet) to different delivery points.
 It needs to consider road conditions, traffic and realistic travel times.
 It ensures timely delivery of packages.
1. WHAT IS THE CRITICAL PATH ? DETERMINE USING DJIKSTRA’S ALGORITHM.
2. WHAT WILL BE THE MINIMUM SPANNING TREE CONSIDERING SOURCE NODE ‘1’ ?
DISTANCE OF DISTANCE FROM
TOTAL
PRECEDING PRECEDING PRECEDING
NODE DISTANCE
NODE NODE NODE
(A+B)
(A) (B)

1 - - - 0
2 1 0 3 3
3 1 0 4 4
4 1 0 2 2
5 2 3 4 7
6 3 4 5 9
7 4 2 5 7
5 7 5 12
8
3 4 6 10
8 10 6 16
9 6 9 4 13
7 7 3 10
10 8 10 3 13
11 9 10 3 13
12 7 7 7 14
13 10 13 5 18 CRITICAL PATH : 1-4-7-9-11-15
14 12 14 4 18
(TOTAL UNITS – 19)
11 13 6 19
15 13 18 4 22
14 18 5 23
 CRITICAL PATH : 1-4-7-9-11-15  DISCONNECTED NODES: 2,3,5,6,8,10,12,13,14
 To reach node 2, we can only reach from 1-2
 To reach node 3, we can only reach from 1-3
 To reach node 5, we can only reach from 2-5
 To reach node 6, we can only reach from 3-6
 To reach node 8, we need to cover either 5-8 or 3-8. We will follow the shorter branch which is 5-8
 To reach node 10, we can only reach from 8-10
 To reach node 12, we can only reach from 7-12
 To reach node 13, we can only reach from 10-13
 To reach node 14, we can only reach from 12-14

MINIMUM SPANNING TREE


CONSIDERING
SOURCE NODE ‘1’
(TOTAL 59 UNITS ARE NECESSRY TO
COVER ALL DISTANCE)

You might also like