Configured jung graph up correctly and setup basic querying of shortest
path. Steps for the future are 1. organizing the graph data so each hero
is a single vertex connected by an edge that is a list of all issues that
each hero a and b mutually appeared in. 2. Setup basic java web service
that can be queried for the shortest path. 3. Implement a javascript
frontend that queries the web service and displays the data using
arbor.js most likely.

-Frank Dye