Course curriculum
-
01
1 Graphs and networks
Show details- Review of basic concepts FREE PREVIEW
- The adjacency matrix FREE PREVIEW
- Properties of graphs and Euler's rule FREE PREVIEW
- Quiz - Basic concepts of graphs
-
02
2 Exploring and travelling problems
Show details- Review of basic concepts
- Eulerian trails and circuits
- Hamiltonian paths and cycles
-
03
3 Trees and minimum connector problems
Show details- Review of basic concepts
- Prim's algorithm
- Quiz - Trees and minimum spanning tree
- Short answer questions - Networks
- Solutions - Networks
-
04
4 Flow problems
Show details- Capacity, source and sink
- Small-scale network flow problems by inspection
- Maximum-flow, minimum-cut
- Quiz - Flow problems
-
05
5 Shortest path problems
Show details- By inspection
- Dijkstra's algorithm
- Quiz - Shortest path
-
06
6 Matching problems
Show details- Bipartite graphs and matching problems
- The Hungarian algorithm
- Quiz - Matching problems
-
07
7 The scheduling problem and critical path analysis
Show details- Precedence table
- Earliest Starting Time, Latest Starting Time and the critical path
- Dummy activity
- Crashing
- Short answer questions - The scheduling problem and critical path
- Solutions - The scheduling problem and critical path