Graph Traversals TODO: Add notes here - leaving blank for now. Depth First Search Breadth First Search Transitive Closure Topological Sorting Shortest Paths Weighted Paths Dijkstra's Bellman-Ford Floyd-Warshall