Day 31 mat385

• Announcements:
  • We agreed to push our next exam back a week (until 4/17).
  • Homework for 5.3 due
  • Homework for 6.2 (due Wed, 4/8)

• Questions on things?

• We'll wrap up section 6.2: Euler Paths and Hamiltonian Circuits,

• then start section 6.3: Shortest Path and Minimal Spanning Tree

Links:

• Details of the workings of Dijkstra's algorithm, Bellman-Ford, and Floyd's algorithm.
• An animation of Dijkstra's algorithm (without stated destination node)
• Sir William Rowan Hamilton, 1805-1865
• Leonhard Euler, 1707-1783
• The paper which our author cites to dispute that Euler created graph theory to solve the Konigsberg bridge problem (one of the authors is the man who gave us the codon problem, Brian Hopkins; the other is the author of a wonderful book on Lewis Carroll).
• Traveling salesman problem
• www.cs.sunysb.edu/~algorith/files/traveling-salesman.shtml