[SCE2304]
[progress]
Practical #5, semester 1, 2000
Group A: week 12, 22 May...
Group B: week 13, 29 May...
This prac' is an extension of the [previous one].
You can assume that the graph is
[acyclic].
- Group A:
Extend your program for the previous prac' to print a
topological sort
of the vertices in the graph.
- Group B:
Extend your program for the previous prac' to print a critical path
for the graph, i.e. find the shortest possible total
time to complete the project represented by the graph,
and show the critical sub-tasks (vertices).
- [6 marks]
© 2000, L. Allison, Comp. Sci. & SWE,
Monash University, Australia