@Override protected void initCollections(int size) { super.initCollections(Math.min(size, 2000)); }
@Override protected void initCollections( int nodes ) { // algorithm with CH does not need that much memory pre allocated super.initCollections(Math.min(initialCollectionSize, nodes)); }
@Override protected void initCollections(int size) { super.initCollections(Math.min(size, 2000)); }
@Override protected void initCollections(int size) { super.initCollections(Math.min(size, 2000)); }
public AStarBidirection( Graph graph, FlagEncoder encoder, Weighting weighting, TraversalMode tMode ) { super(graph, encoder, weighting, tMode); int size = Math.min(Math.max(200, graph.getNodes() / 10), 2000); initCollections(size); BeelineWeightApproximator defaultApprox = new BeelineWeightApproximator(nodeAccess, weighting); defaultApprox.setDistanceCalc(new DistancePlaneProjection()); setApproximation(defaultApprox); }