Networks: Worked Exam-Style Problems

What this note covers

1. Minimum spanning tree with Prim's algorithm
2. Shortest path by Dijkstra's labelling
3. Maximum flow and minimum cut
4. Allocation with the Hungarian algorithm
5. Reading an activity table into a network: EST, LST and the critical path
6. Crashing the project network

6 sections · 14 key terms & formulas · 6 common mistakes