@Test public void testFindingWayGeometry() { Graph g = createGHStorage(encodingManager); NodeAccess na = g.getNodeAccess(); na.setNode(10, 51.2492152, 9.4317166); na.setNode(20, 52, 9); na.setNode(30, 51.2, 9.4); na.setNode(50, 49, 10); g.edge(20, 50, 1, true).setWayGeometry(Helper.createPointList(51.25, 9.43)); g.edge(10, 20, 1, true); g.edge(20, 30, 1, true); LocationIndex index = createIndex(g, 2000); assertEquals(20, findID(index, 51.25, 9.43)); }
@Test public void testMoreReal() { Graph graph = createGHStorage(new EncodingManager("car")); NodeAccess na = graph.getNodeAccess(); na.setNode(1, 51.2492152, 9.4317166); na.setNode(0, 52, 9); na.setNode(2, 51.2, 9.4); na.setNode(3, 49, 10); graph.edge(1, 0, 1000, true); graph.edge(0, 2, 1000, true); graph.edge(0, 3, 1000, true).setWayGeometry(Helper.createPointList(51.21, 9.43)); LocationIndex index = createIndex(graph, -1); assertEquals(2, findID(index, 51.2, 9.4)); }
Graph createTestGraph(EncodingManager em) { Graph graph = createGHStorage(new RAMDirectory(), em, false); NodeAccess na = graph.getNodeAccess(); na.setNode(0, 0.5, -0.5); na.setNode(1, -0.5, -0.5); na.setNode(2, -1, -1); na.setNode(3, -0.4, 0.9); na.setNode(4, -0.6, 1.6); graph.edge(0, 1, 1, true); graph.edge(0, 2, 1, true); graph.edge(0, 4, 1, true); graph.edge(1, 3, 1, true); graph.edge(2, 3, 1, true); graph.edge(2, 4, 1, true); graph.edge(3, 4, 1, true); return graph; }
@Test public void testFindNClosest() { Graph graph = createGHStorage(new RAMDirectory(), encodingManager, false); NodeAccess na = graph.getNodeAccess(); na.setNode(0, 0.0010, 0.0000);
private Graph createTestGraphWithWayGeometry() { Graph graph = createGHStorage(encodingManager); NodeAccess na = graph.getNodeAccess(); na.setNode(0, 0.5, -0.5); na.setNode(1, -0.5, -0.5); na.setNode(2, -1, -1); na.setNode(3, -0.4, 0.9); na.setNode(4, -0.6, 1.6); graph.edge(0, 1, 1, true); graph.edge(0, 2, 1, true); // insert A and B, without this we would get 0 for 0,0 graph.edge(0, 4, 1, true).setWayGeometry(Helper.createPointList(1, 1)); graph.edge(1, 3, 1, true).setWayGeometry(Helper.createPointList(0, 0)); graph.edge(2, 3, 1, true); graph.edge(2, 4, 1, true); graph.edge(3, 4, 1, true); return graph; }
Graph graph = createGHStorage(new RAMDirectory(), tmpEM, false); NodeAccess na = graph.getNodeAccess();
@Test public void testCrossBoundaryNetwork_issue667() { Graph graph = createGHStorage(new RAMDirectory(), encodingManager, false); NodeAccess na = graph.getNodeAccess(); na.setNode(0, 0.1, 179.5);
Graph createTestGraph2() { Graph graph = createGHStorage(new RAMDirectory(), encodingManager, false); NodeAccess na = graph.getNodeAccess(); na.setNode(8, 49.94553, 11.57214);