Networks

Eulerian trails and circuits

Minimum spanning tree

Shortest path problems

Activity tables and forward scanning  

Backward scanning and critical path analysis  

Network flow problems

The ‘maximum-flow minimum-cut’ theorem