maroonlol
✅ Solve please delete this post
I see the issue now and I have solved it @V.EINA Jaken Thank you for all your help your detailed questions made me examine my code and then I saw I had parts missing and I also had an issue of retrieving data which I discorved thanks to you
62 replies
✅ Solve please delete this post
For the Latest Start Time I'm attempting in going backwards with setting last node as the project duration. This is how I calculated latest start time for the following example
V9 is equal to 18 as total project duration then to calculate the activity leading form and too latest finish time for V1..V4 we would have to go backwards through this path:
V9->V8->V6->V4->V1 = 4+4+2+5 =15
If we do the calculation 18-15 it should give 3 as the latest finish time for V1..V4 but my output gives me 1
62 replies
✅ Solve please delete this post
Context - Code seems to be implementing the Critical Path Method (CPM), which is normally used for project management.
Nodes and Activities:
- Nodes represent different tasks or activities in a project.
- Activities connect nodes, indicating the flow or dependency between them.
Start and End:
- The project starts with certain nodes and ends with others.
- I determine the earliest start time for activities, considering dependencies.
Calculating Earliest Start Times:
- The
CalculateEarliestStartTimes method determines the earliest start times for each node/activity.
- It starts with nodes that have no incoming edges and propagates forward, updating start times based on activity durations.
Displaying Results:
- The main method then displays the calculated earliest start times for each activity.
Latest Start Times:
- Later, the program calculates the latest start times using the CalculateLatestStartTimes method, considering the project's end time and backward propagation.
Output:
- The program prints a table with details for each activity, including the activity's leading nodes, duration, earliest start time, and latest start time.62 replies
✅ Solve please delete this post
I think it is because if this line of code:
earliestStartTime[startnode] = 1
That was the issue because for example if I changed it to 300 that first nodes with no dependences will also be 300 for ealiest start time and same for the latest start times
62 replies