6.01  Networks

6.02 Eulerian trails and circuits

6.03 Minimum spanning tree

6.04 Shortest path problems

6.05 Activity tables and forward scanning  

6.06 Backward scanning and critical path analysis  

6.07 Network flow problems

6.08 The ‘maximum-flow minimum-cut’ theorem