[prev] 79 [next]

Summary

  • Graph traversal
    • depth-first search (DFS)
    • breadth-first search (BFS)
    • applications: path finding, connected components
  • Hamiltonian paths/circuits, Euler paths/circuits
  • Digraphs: representations, applications, reachability
  • Suggested reading (Sedgewick):
    • Hamiltonian/Euler paths … Ch.17.7
    • Graph search … Ch.18.1-18.3,18.7
    • Digraphs … Ch.19.1-19.3