GreaterMKEMeetup/javafx-shortest-path-challenge — pull request #1 by jgitter (2014-12-14 01:34:16+00:00)
Title: Solution candidates

GreedySolution is a simple solution that looks for the next nearest node
GreedyManhattanSolution does the same thing, but approximates the distance between nodes using the Manhattan method.
GreedyHealingSolution takes the best of the previous 2 solutions and attempts to "heal" it incrementally, one node at a time
Fixed a bug in Main.java that causes NullPointerException