Routing points will always be submitted at the outset, so these must be used to identify the closest nodes on the full graph, and these nodes must then not be removed in the compact graph. Easy to implement with current graph.cpp code - just need to work out how these nodes are going to be initially specified in the R call.
Routing points will always be submitted at the outset, so these must be used to identify the closest nodes on the full graph, and these nodes must then not be removed in the compact graph. Easy to implement with current
graph.cppcode - just need to work out how these nodes are going to be initially specified in theRcall.