Section 9.1: Euler Circuits and Hamiltonian Cycles
9.1 Outline
- Euler circuits
- Konigsberg bridge problem
- definition of a graph (or a network)
- traversable network
- degree of a vertex
- Euler circuit
- odd/even vertex
- connected network
- Euler’s circuit theorem
- Applications of Euler circuits
- supermarket problem
- police patrol problem
- floor-plan problem