Final Proiect

Write a program to calculate the length of the project given the project's network dependency graph.

Your program in part $1)$ should:

Accept as input the name of a file that contains a network dependency graph.

Read the contents of the file

Display the following information on each node: name, duration, predecessors, successors, early start, early finish, late start, late finish, and an indication $("y"$ or $"n")$ as to whether the node is on the critical path.

Display the length of the project

Below is a test scenario for your program using hypothetical data:

$\backslash$table$[[$Application:$,$Node,Time,Pred,Succ,,ef$,$Is$,,],[$Application:$,$S$,,$P$,$a$,$ b$,,$of$,0,0,Y$