Finding the critical path for each neighbor of task c

Info icon This preview shows pages 137–145. Sign up to view the full content.

View Full Document Right Arrow Icon
Finding the critical path For each neighbor of Task C: Decrement the in-degree, push if necessary, and check if we must update the critical time Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 1 8.1 11.3 B E 0 9.5 26.6 F F 0 17.1 17.1 Ø Queue
Image of page 137

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Finding the critical path For each neighbor of Task C: Decrement the in-degree, push if necessary, and check if we must update the critical time Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 0 8.1 31.3 C E 0 9.5 26.6 F F 0 17.1 17.1 Ø D Queue
Image of page 138
Finding the critical path Pop Task D and update its critical time 31.3 + 8.1 = 39.4 Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 0 8.1 31.3 C E 0 9.5 26.6 F F 0 17.1 17.1 Ø Queue
Image of page 139

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Finding the critical path Pop Task D and update its critical time 31.3 + 8.1 = 39.4 Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 0 8.1 39.4 C E 0 9.5 26.6 F F 0 17.1 17.1 Ø Queue
Image of page 140
Finding the critical path Task D has no neighbors and the queue is empty We are done Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 0 8.1 39.4 C E 0 9.5 26.6 F F 0 17.1 17.1 Ø Queue
Image of page 141

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Finding the critical path Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 0 8.1 39.4 C E 0 9.5 26.6 F F 0 17.1 17.1 Ø
Image of page 142
Finding the critical path We can also plot the completing of the tasks in time Task In- degree Task Time Critical Time Previous Task A 0 5.2 5.2 Ø B 0 6.1 11.3 A C 0 4.7 31.3 E D 0 8.1 39.4 C E 0 9.5 26.6 F F 0 17.1 17.1 Ø
Image of page 143

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Finding the critical path Incidentally, the task and previous task defines a forest using the parental tree data structure Task Previous Task A Ø B A C E D C E F F Ø
Image of page 144
Summary In this topic, we have discussed topological sorts Sorting of elements in a DAG Implementation A table of in-degrees Select that vertex which has current in-degree zero We defined critical paths The implementation requires only a few more table entries
Image of page 145
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern