- Graphs, Semi-Eulerian, Eulerian, Valency of nodes etc.
- Route inpection algorithm
- Identifying odd vertices, possible pairings, identifying shortest route
- Starting / finishing at same point
- Starting / finishing at different points
- Example of exam question using route inspection
No comments:
Post a Comment