Just wondering if I am understanding DijkstraBidirectionRef correctly.
Does this calculate both directions between points?
eg. Point A to Point B and Point B to Point A
I can process the path using
path = new DijkstraBidirectionRef(queryGraph, w, EDGE_BASED).calcPath(fromSnap.getClosestNode(), toSnap.getClosestNode());
But when mapped this only shows the Point A to Point B.
PointList tmp = path.calcPoints();
Am I required to also make another path Point B to Point A or do I need to setup an algo using BidirRoutingAlgorithm?