public boolean containsLatitude(Graph g, EdgeIterator iter, double latitude) { NodeAccess na = g.getNodeAccess(); while (iter.next()) { if (Math.abs(na.getLatitude(iter.getAdjNode()) - latitude) < 1e-4) return true; } return false; }
public void initSimpleGraph(Graph g) { // 6 | 4 // 5 | // | 6 // 4 | 5 // 3 | // 2 | 1 // 1 | 3 // 0 | 2 // -1 | 0 // ---|------------------- // |-2 -1 0 1 2 3 4 // NodeAccess na = g.getNodeAccess(); na.setNode(0, -1, -2); na.setNode(1, 2, -1); na.setNode(2, 0, 1); na.setNode(3, 1, 2); na.setNode(4, 6, 1); na.setNode(5, 4, 4); na.setNode(6, 4.5, -0.5); g.edge(0, 1, 3.5, true); g.edge(0, 2, 2.5, true); g.edge(2, 3, 1, true); g.edge(3, 4, 3.2, true); g.edge(1, 4, 2.4, true); g.edge(3, 5, 1.5, true); // make sure 6 is connected g.edge(6, 4, 1.2, true); }
public static int getIdOf(Graph g, double latitude) { int s = g.getNodes(); NodeAccess na = g.getNodeAccess(); for (int i = 0; i < s; i++) { if (Math.abs(na.getLatitude(i) - latitude) < 1e-4) { return i; } } return -1; }
protected void initExampleGraph(Graph g) { NodeAccess na = g.getNodeAccess(); na.setNode(0, 12, 23); na.setNode(1, 38.33f, 135.3f); na.setNode(2, 6, 139); na.setNode(3, 78, 89); na.setNode(4, 2, 1); na.setNode(5, 7, 5); g.edge(0, 1, 12, true); g.edge(0, 2, 212, true); g.edge(0, 3, 212, true); g.edge(0, 4, 212, true); g.edge(0, 5, 212, true); }
@Test public void testNoErrorOnEdgeCase_lastIndex() { final EncodingManager encodingManager = new EncodingManager("car"); int locs = 10000; Graph g = AbstractLocationIndexTester.this.createGHStorage( new MMapDirectory(location), encodingManager, false); NodeAccess na = g.getNodeAccess(); Random rand = new Random(12); for (int i = 0; i < locs; i++) { na.setNode(i, (float) rand.nextDouble() * 10 + 10, (float) rand.nextDouble() * 10 + 10); } idx = createIndex(g, 200); Helper.close((Closeable) g); }
protected void checkGraph(Graph g) { NodeAccess na = g.getNodeAccess(); assertTrue(na.is3D()); assertTrue(g.getBounds().isValid()); assertEquals(new BBox(10, 20, 10, 12, 0, 1), g.getBounds()); assertEquals(10, na.getLatitude(0), 1e-2); assertEquals(10, na.getLongitude(0), 1e-2); EdgeExplorer explorer = g.createEdgeExplorer(carOutFilter); assertEquals(2, GHUtility.count(explorer.setBaseNode(0))); assertEquals(GHUtility.asSet(2, 1), GHUtility.getNeighbors(explorer.setBaseNode(0))); EdgeIterator iter = explorer.setBaseNode(0); assertTrue(iter.next()); assertEquals(Helper.createPointList3D(3.5, 4.5, 0, 5, 6, 0), iter.fetchWayGeometry(0)); assertTrue(iter.next()); assertEquals(Helper.createPointList3D(1.5, 1, 0, 2, 3, 0), iter.fetchWayGeometry(0)); assertEquals(Helper.createPointList3D(10, 10, 0, 1.5, 1, 0, 2, 3, 0), iter.fetchWayGeometry(1)); assertEquals(Helper.createPointList3D(1.5, 1, 0, 2, 3, 0, 11, 20, 1), iter.fetchWayGeometry(2)); assertEquals(11, na.getLatitude(1), 1e-2); assertEquals(20, na.getLongitude(1), 1e-2); assertEquals(2, GHUtility.count(explorer.setBaseNode(1))); assertEquals(GHUtility.asSet(2, 0), GHUtility.getNeighbors(explorer.setBaseNode(1))); assertEquals(12, na.getLatitude(2), 1e-2); assertEquals(12, na.getLongitude(2), 1e-2); assertEquals(1, GHUtility.count(explorer.setBaseNode(2))); assertEquals(GHUtility.asSet(0), GHUtility.getNeighbors(explorer.setBaseNode(2))); EdgeIteratorState eib = GHUtility.getEdge(g, 1, 2); assertEquals(Helper.createPointList3D(), eib.fetchWayGeometry(0)); assertEquals(Helper.createPointList3D(11, 20, 1), eib.fetchWayGeometry(1)); assertEquals(Helper.createPointList3D(12, 12, 0.4), eib.fetchWayGeometry(2)); assertEquals(GHUtility.asSet(0), GHUtility.getNeighbors(explorer.setBaseNode(2))); }
private void checkExampleGraph(Graph graph) { NodeAccess na = graph.getNodeAccess(); assertEquals(12f, na.getLatitude(0), 1e-6); assertEquals(23f, na.getLongitude(0), 1e-6); assertEquals(38.33f, na.getLatitude(1), 1e-6); assertEquals(135.3f, na.getLongitude(1), 1e-6); assertEquals(6, na.getLatitude(2), 1e-6); assertEquals(139, na.getLongitude(2), 1e-6); assertEquals(78, na.getLatitude(3), 1e-6); assertEquals(89, na.getLongitude(3), 1e-6); assertEquals(GHUtility.asSet(0), GHUtility.getNeighbors(carOutExplorer.setBaseNode((1)))); assertEquals( GHUtility.asSet(5, 4, 3, 2, 1), GHUtility.getNeighbors(carOutExplorer.setBaseNode(0))); try { assertEquals(0, count(carOutExplorer.setBaseNode(6))); // for now return empty iterator // assertFalse(true); } catch (Exception ex) { } }
public Graph createSampleGraph(EncodingManager encodingManager) { Graph graph = AbstractLocationIndexTester.this.createGHStorage(encodingManager); // length does not matter here but lat,lon and outgoing edges do! // // lat /--------\ // 5 o- p--------\ q // \ /-----\-----n | | // 4 k /--l-- m/ // / \ j \ | // 3 | g \ h---i / // | \ / / // 2 e---------f-- / // / \-d // 1 /--b-- \ // | \--------c // 0 a // // lon: 0 1 2 3 4 5 int a0 = 0; NodeAccess na = graph.getNodeAccess(); na.setNode(0, 0, 1.0001f); int b1 = 1; na.setNode(1, 1, 2); int c2 = 2; na.setNode(2, 0.5f, 4.5f); int d3 = 3; na.setNode(3, 1.5f, 3.8f); int e4 = 4; na.setNode(4, 2.01f, 0.5f); int f5 = 5; na.setNode(5, 2, 3); int g6 = 6; na.setNode(6, 3, 1.5f); int h7 = 7; na.setNode(7, 2.99f, 3.01f); int i8 = 8; na.setNode(8, 3, 4); int j9 = 9; na.setNode(9, 3.3f, 2.2f); int k10 = 10; na.setNode(10, 4, 1); int l11 = 11; na.setNode(11, 4.1f, 3); int m12 = 12; na.setNode(12, 4, 4.5f); int n13 = 13; na.setNode(13, 4.5f, 4.1f); int o14 = 14; na.setNode(14, 5, 0); int p15 = 15; na.setNode(15, 4.9f, 2.5f); int q16 = 16; na.setNode(16, 5, 5); // => 17 locations graph.edge(a0, b1, 1, true); graph.edge(c2, b1, 1, true); graph.edge(c2, d3, 1, true); graph.edge(f5, b1, 1, true); graph.edge(e4, f5, 1, true); graph.edge(m12, d3, 1, true); graph.edge(e4, k10, 1, true); graph.edge(f5, d3, 1, true); graph.edge(f5, i8, 1, true); graph.edge(f5, j9, 1, true); graph.edge(k10, g6, 1, true); graph.edge(j9, l11, 1, true); graph.edge(i8, l11, 1, true); graph.edge(i8, h7, 1, true); graph.edge(k10, n13, 1, true); graph.edge(k10, o14, 1, true); graph.edge(l11, p15, 1, true); graph.edge(m12, p15, 1, true); graph.edge(q16, p15, 1, true); graph.edge(q16, m12, 1, true); return graph; }
@Test public void testGrid() { Graph g = createSampleGraph(new EncodingManager("car")); int locs = g.getNodes(); idx = createIndex(g, -1); // if we would use less array entries then some points gets the same key so avoid that for this // test // e.g. for 16 we get "expected 6 but was 9" i.e 6 was overwritten by node j9 which is a bit // closer to the grid center // go through every point of the graph if all points are reachable NodeAccess na = g.getNodeAccess(); for (int i = 0; i < locs; i++) { double lat = na.getLatitude(i); double lon = na.getLongitude(i); assertEquals("nodeId:" + i + " " + (float) lat + "," + (float) lon, i, findID(idx, lat, lon)); } // hit random lat,lon and compare result to full index Random rand = new Random(12); LocationIndex fullIndex; if (hasEdgeSupport()) fullIndex = new Location2IDFullWithEdgesIndex(g); else fullIndex = new Location2IDFullIndex(g); DistanceCalc dist = new DistanceCalcEarth(); for (int i = 0; i < 100; i++) { double lat = rand.nextDouble() * 5; double lon = rand.nextDouble() * 5; int fullId = findID(fullIndex, lat, lon); double fullLat = na.getLatitude(fullId); double fullLon = na.getLongitude(fullId); float fullDist = (float) dist.calcDist(lat, lon, fullLat, fullLon); int newId = findID(idx, lat, lon); double newLat = na.getLatitude(newId); double newLon = na.getLongitude(newId); float newDist = (float) dist.calcDist(lat, lon, newLat, newLon); if (testGridIgnore(i)) { continue; } assertTrue( i + " orig:" + (float) lat + "," + (float) lon + " full:" + fullLat + "," + fullLon + " fullDist:" + fullDist + " found:" + newLat + "," + newLon + " foundDist:" + newDist, Math.abs(fullDist - newDist) < 50000); } fullIndex.close(); Helper.close((Closeable) g); }