What you will learn:

2A Networks
2B Travelling a network
2C Drawing a network diagram
2D Eulerian and Hamiltonian walks
2E Network problems
2F Minimal spanning trees
2G Connector problems
2H Shortest path

Outcomes:

• Identify and use network terminology.
• Recognise the circumstances when networks can be used to solve a problem.
• Draw a network to represent a map.
• Draw a network to represent information given in a table.
• Investigate and solve practical problems involving network diagrams.
• Define a tree and a minimum spanning tree for a given network.
• Determine and use minimum spanning trees to solve problems.
• Identify the shortest path on a network diagram.
• Recognise when the shortest path is not necessarily the best path.