com.graphhopper.routing.util.RoutingAlgorithmSpecialAreaTests Maven / Gradle / Ivy
Show all versions of graphhopper Show documentation
/*
* Licensed to GraphHopper and Peter Karich under one or more contributor
* license agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* GraphHopper licenses this file to you under the Apache License,
* Version 2.0 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.graphhopper.routing.util;
import com.graphhopper.GraphHopper;
import com.graphhopper.routing.ch.PrepareContractionHierarchies;
import com.graphhopper.storage.Graph;
import com.graphhopper.storage.GraphBuilder;
import com.graphhopper.storage.index.Location2IDIndex;
import com.graphhopper.storage.LevelGraph;
import com.graphhopper.storage.LevelGraphStorage;
import com.graphhopper.util.StopWatch;
import static com.graphhopper.routing.util.NoOpAlgorithmPreparation.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
/**
* Integration tests for one bigger area - at the moment Unterfranken (Germany). Execute via
* ./graphhopper.sh test unterfranken.osm
*
* @author Peter Karich
*/
public class RoutingAlgorithmSpecialAreaTests
{
private Logger logger = LoggerFactory.getLogger(getClass());
private final Graph unterfrankenGraph;
private final Location2IDIndex idx;
public RoutingAlgorithmSpecialAreaTests( GraphHopper graphhopper )
{
this.unterfrankenGraph = graphhopper.getGraph();
StopWatch sw = new StopWatch().start();
idx = graphhopper.getIndex();
logger.info(idx.getClass().getSimpleName() + " index. Size:"
+ (float) idx.getCapacity() / (1 << 20) + " MB, took:" + sw.stop().getSeconds());
}
public void start()
{
testIndex();
testAlgos();
}
void testAlgos()
{
if (unterfrankenGraph instanceof LevelGraph)
{
throw new IllegalStateException("run testAlgos only with a none-LevelGraph. Use prepare.chShortcuts=false "
+ "Or use prepare.chShortcuts=shortest and avoid the preparation");
}
TestAlgoCollector testCollector = new TestAlgoCollector("testAlgos");
final EncodingManager encodingManager = new EncodingManager("CAR");
CarFlagEncoder carEncoder = (CarFlagEncoder) encodingManager.getEncoder("CAR");
boolean ch = true;
Collection prepares = createAlgos(unterfrankenGraph, carEncoder,
ch, new ShortestCalc(), encodingManager);
for (AlgorithmPreparation prepare : prepares)
{
int failed = testCollector.errors.size();
// using index.highResolution=1000
testCollector.assertDistance(prepare.createAlgo(), idx.findID(50.0314, 10.5105), idx.findID(50.0303, 10.5070), 559, 19);
testCollector.assertDistance(prepare.createAlgo(), idx.findID(49.51451, 9.967346), idx.findID(50.2920, 10.4650), 107840, 1677);
testCollector.assertDistance(prepare.createAlgo(), idx.findID(50.0780, 9.1570), idx.findID(49.5860, 9.9750), 93122, 1292);
testCollector.assertDistance(prepare.createAlgo(), idx.findID(50.2800, 9.7190), idx.findID(49.8960, 10.3890), 77324, 1298);
testCollector.assertDistance(prepare.createAlgo(), idx.findID(49.8020, 9.2470), idx.findID(50.4940, 10.1970), 125764, 2237);
testCollector.assertDistance(prepare.createAlgo(), idx.findID(49.72449, 9.23482), idx.findID(50.4140, 10.2750), 137206, 2348);
testCollector.assertDistance(prepare.createAlgo(), idx.findID(50.1100, 10.7530), idx.findID(49.6500, 10.3410), 74181, 1371);
System.out.println("unterfranken " + prepare.createAlgo() + ": " + (testCollector.errors.size() - failed) + " failed");
}
testCollector.printSummary();
}
public static Collection createAlgos( Graph g,
FlagEncoder encoder, boolean withCh, WeightCalculation weightCalc, EncodingManager manager )
{
List prepare = new ArrayList(Arrays.asList(
createAlgoPrepare(g, "astar", encoder, weightCalc),
createAlgoPrepare(g, "dijkstraOneToMany", encoder, weightCalc),
createAlgoPrepare(g, "astarbi", encoder, weightCalc),
createAlgoPrepare(g, "dijkstraNative", encoder, weightCalc),
createAlgoPrepare(g, "dijkstrabi", encoder, weightCalc),
createAlgoPrepare(g, "dijkstra", encoder, weightCalc)));
if (withCh)
{
LevelGraph graphCH = (LevelGraphStorage) g.copyTo(new GraphBuilder(manager).levelGraphCreate());
PrepareContractionHierarchies prepareCH = new PrepareContractionHierarchies().setGraph(graphCH).setVehicle(encoder).setType(weightCalc);
prepareCH.doWork();
prepare.add(prepareCH);
// TODO prepare.add(prepareCH.createAStar().approximation(true).approximationFactor(.9));
}
return prepare;
}
void testIndex()
{
TestAlgoCollector testCollector = new TestAlgoCollector("testIndex");
testCollector.queryIndex(unterfrankenGraph, idx, 50.081241, 10.124366, 14.0);
testCollector.queryIndex(unterfrankenGraph, idx, 50.081146, 10.124496, 0.0);
testCollector.queryIndex(unterfrankenGraph, idx, 49.682000, 9.943000, 602.2);
testCollector.queryIndex(unterfrankenGraph, idx, 50.066495, 10.191836, 53.1);
testCollector.printSummary();
}
}