04/15/2019 class
    
Dijkstra's algorithm -- shortest path, weighted edges (JavaScript)
      
Your representation will need to be be more complicated than this.
      
This is inefficient, as it is not hashing graph component objects like nodes.
04/08/2018 class
    
basic digraph representation by adjacency list (JavaScript)
      
Your representation will need to be be more complicated than this.
      
This is innefficient.
      
You will need to have hash maps for your node names
so you can find a single node in constant time.
    
Topo Sort on digraph, unweighted edges (JavaScript)