Chapter 7: Networks, Paths and Trees Notes

Sections

1. 7A The language of networks Mastered

   Vertices, edges and degree, the sum of degrees rule, connected networks, and the difference between a walk, a trail, a path and a cycle.

   Open notes
2. 7B Weighted and directed networks Mastered

   Weights on edges, one-way edges, turning a table or a map into a network diagram, and reading a network back into a table.

   Open notes
3. 7C Shortest paths Mastered

   Finding the shortest path between two vertices of a weighted network, first by inspection and then with the labelling method (Dijkstra's algorithm).

   Open notes
4. 7D Minimum spanning trees Mastered

   Trees and spanning trees, and finding a minimum spanning tree with Kruskal's algorithm and Prim's algorithm.

   Open notes
5. 7E Connector problems and best paths Mastered

   Solving minimal connector problems with minimum spanning trees, and why the shortest path is not always in the tree or the best choice.

   Open notes