Section 9.1: Euler Circuits and Hamiltonian Cycles

9.1 Outline

  1. Euler circuits
    1. Konigsberg bridge problem
    2. definition of a graph (or a network)
    3. traversable network
    4. degree of a vertex
    5. Euler circuit
    6. odd/even vertex
    7. connected network
    8. Euler’s circuit theorem
  2. Applications of Euler circuits
    1. supermarket problem
    2. police patrol problem
    3. floor-plan problem
See the whole entry