/** * Interate through all the paths and find the longest one * * @return longest path distance */ public double getLongestPath() { double max = 0; for (Path p : getPaths()) { if (p.calculateDistance() > max) max = p.calculateDistance(); } return max; }