Logic behind extractPath

(referencing branch 0.5)
Hi- i wasn wondering why in DijkstraBidirectionalRef.java - extractPath function:
why return bestPath if not finished()?

We just return bestPath as a kind of an empty place holder for Path to avoid NPE etc and make consumption more clear. I.e. consuming method should call bestPath.isFound() to see if something usable was calculated.

This topic was automatically closed 8 days after the last reply. New replies are no longer allowed.