2Networks
PL E
In this chapter you will learn how to: use networks to model problems
use spanning trees to solve network optimisation problems solve route inspection problems
find and interpret upper and lower bounds for a travelling salesperson problem.
You should be able to
1
understand the terms cycle and tree.
SA
Chapter 1
M
Before you start‌
Original material Š Cambridge University Press 2018
a Find a cycle through every node in this graph. b Find a tree that connects every node in this graph.