+ Allows result of topological sort to match examples shown in MIT Algorithms + Correct order of initialization for all graphs and adjacent nodes in graph.cpp + Provide overloaded DFS for beginning at a specific node within the graph
+ Add comments to explain when to offset and when to use key values
+ Using pseudocode examples from MIT Intro to Algorithms