added Graph class, is a modified EdgeWeightedDigraph from Sedgewick from algorithm course
added ReverseData, which simply is a reversed data class
modified node to contain a coordinate instead of direct double values, this was so it could be used in Graph
modified edge to contain Coordinate instead of direct primitive doubles
modified Model to also create a graph
added DijkstraSP from Sedgewick, modified to use Coordinate
added IndexMinPQ from Sedgewick
Data classes now also contains a weight
edge now also has weight
graph is now loaded and shortest path from some point is calculated
text fields to and from can now be accessed
path is now drawn with thick green stroke
fixed null pointer exception, center point are NOT recognized
model no longer does a shortest path search on construction
optimized Dijkstra, all nodes now have an id
merged
merged again