Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
How to determine the critical path in a pert chart using dijkstra's algorithm. The steps to calculate the shortest and longest paths from the start to the finish of a project, with a given pert chart as an example. It also lists all the simple paths and their total distances.
Typology: Study notes
1 / 2
This page cannot be seen from the preview
Don't miss anything!
Printed 2020/11/30 at 01:
Minimum Path: Available from Dijkstra’s Algorithm Dijkstra's algorithm Starting from 0 0 to 1 (3) 1 to 2 (4) 2 to 3 (10) 3 to 4 (3) 4 to 8 (2) 3 to 7 (7) 3 to 6 (7) 3 to 5 (9) 8 to 9 (5) 7 to 10 (5) Total distance: 55 Path end-point to trace from: 10 10 <-- 7 <-- 3 <-- 2 <-- 1 <-- 0 Total distance: 29 Longest path requires examining all paths: Listing of All Simple Paths: 0 to 1 (3) 1 to 2 (4) 2 to 3 (10) 3 to 4 (3) 4 to 8 (2) 8 to 9 (5) 9 to 10 (8) Total: 35 0 to 1 (3) 1 to 2 (4) 2 to 3 (10) 3 to 5 (9) 5 to 8 (1) 8 to 9 (5) 9 to 10 (8) Total: 40 0 to 1 (3) 1 to 2 (4) 2 to 3 (10) 3 to 6 (7) 6 to 8 (1) 8 to 9 (5) 9 to 10 (8) Total: 38 0 to 1 (3) 1 to 2 (4) 2 to 3 (10) 3 to 7 (7) 7 to 10 (5) Total: 29 Printed 2020/11/30 at 01:
