I am having some problems with some D1 questions:
1: On dijkstra some questions say find the shortest route excluding a specific arc, including a specific vertex etc, how do I do these?
2: How do you do gantt charts and scheduling diagrams quickly and how do you draw scheduling diagrams without a gantt chart?
3: How do you determine how many workers from a gantt chart?
4: What do you do on the route inspection questions where they remove an arc (June 2012)
5: What is the maximum number of passes to complete an n list bubble sort?
Get going with the all day revision thread