Lecture Notes on 23 Nov 2020

* Dijkstra's Single Source Shortest Path Algorithm
  - Choose a starting vertex.
  - Create a table with all the other vertices in the graph.
  - From the starting vertex fill the table with the cost of
    visiting all the other vertices.
  - Go to the vertex with the lowest cost and update the cost
    of visiting all the other vertices from the starting vertex.
  - Go to all the other vertices in order of increasing cost and
    update the costs of visiting the other vertices from the 
    starting vertex.
  - When you have visited all the vertices that you can visit 
    from the starting vertex then you are done.

* Worked out example using Dijkstra's Algorithm
https://www.cs.utexas.edu/users/mitra/csFall2020/cs313/notes/Dijkstra.pdf

* Let us look at some fun puzzles that you can use graphs to 
  solve:
https://www.cs.utexas.edu/users/mitra/csFall2020/cs313/notes/Graph_Puzzles.pdf

* Here is one solution:
https://www.cs.utexas.edu/users/mitra/csFall2020/cs313/notes/Graph_Images.pdf

* Some additional terms:
https://www.cs.utexas.edu/users/mitra/csFall2020/cs313/notes/Graph_Terms.pdf