@Test
public void testGetAllEdgesWithDelete() {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
na.setNode(0, 0, 5);
na.setNode(1, 1, 5);
na.setNode(2, 2, 5);
na.setNode(3, 3, 5);
graph.edge(0, 1, 1, true);
graph.edge(0, 2, 1, true);
graph.edge(1, 2, 1, true);
graph.edge(2, 3, 1, true);
AllEdgesIterator iter = graph.getAllEdges();
assertEquals(4, GHUtility.count(iter));
assertEquals(4, iter.getMaxId());
// delete
graph.markNodeRemoved(1);
graph.optimize();
iter = graph.getAllEdges();
assertEquals(2, GHUtility.count(iter));
assertEquals(4, iter.getMaxId());
iter = graph.getAllEdges();
iter.next();
EdgeIteratorState eState = iter.detach(false);
assertEquals(iter.toString(), eState.toString());
iter.next();
assertNotEquals(iter.toString(), eState.toString());
EdgeIteratorState eState2 = iter.detach(true);
assertEquals(iter.getAdjNode(), eState2.getBaseNode());
iter.next();
assertNotEquals(iter.getAdjNode(), eState2.getBaseNode());
}
@Test
public void test8BytesFlags() {
Directory dir = new RAMDirectory();
List<FlagEncoder> list = new ArrayList<FlagEncoder>();
list.add(new TmpCarFlagEncoder(29, 0.001));
list.add(new TmpCarFlagEncoder(29, 0.001));
EncodingManager manager = new EncodingManager(list, 8, 0);
graph = new GraphHopperStorage(dir, manager, false).create(defaultSize);
EdgeIteratorState edge = graph.edge(0, 1);
edge.setFlags(Long.MAX_VALUE / 3);
// System.out.println(BitUtil.LITTLE.toBitString(Long.MAX_VALUE / 3) + "\n" +
// BitUtil.LITTLE.toBitString(edge.getFlags()));
assertEquals(Long.MAX_VALUE / 3, edge.getFlags());
graph.close();
graph = new GraphHopperStorage(dir, manager, false).create(defaultSize);
edge = graph.edge(0, 1);
edge.setFlags(list.get(0).setProperties(99.123, true, true));
assertEquals(99.123, list.get(0).getSpeed(edge.getFlags()), 1e-3);
long flags = GHUtility.getEdge(graph, 1, 0).getFlags();
assertEquals(99.123, list.get(0).getSpeed(flags), 1e-3);
assertTrue(list.get(0).isBool(flags, FlagEncoder.K_FORWARD));
assertTrue(list.get(0).isBool(flags, FlagEncoder.K_BACKWARD));
edge = graph.edge(2, 3);
edge.setFlags(list.get(1).setProperties(44.123, true, false));
assertEquals(44.123, list.get(1).getSpeed(edge.getFlags()), 1e-3);
flags = GHUtility.getEdge(graph, 3, 2).getFlags();
assertEquals(44.123, list.get(1).getSpeed(flags), 1e-3);
assertTrue(list.get(1).isBool(flags, FlagEncoder.K_FORWARD));
assertFalse(list.get(1).isBool(flags, FlagEncoder.K_BACKWARD));
}
@Test
public void testSimpleDelete() {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
na.setNode(0, 12, 23);
na.setNode(1, 38.33f, 135.3f);
na.setNode(2, 3, 3);
na.setNode(3, 78, 89);
graph.edge(3, 0, 21, true);
graph.edge(5, 0, 22, true);
graph.edge(5, 3, 23, true);
graph.markNodeRemoved(0);
graph.markNodeRemoved(3);
assertEquals(6, graph.getNodes());
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
// now actually perform deletion
graph.optimize();
assertEquals(4, graph.getNodes());
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
// shouldn't change anything
graph.optimize();
assertEquals(4, graph.getNodes());
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
}
@Test
public void testSimpleDelete3() {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
na.setNode(7, 7, 1);
na.setNode(8, 8, 1);
na.setNode(9, 9, 1);
na.setNode(11, 11, 1);
// mini subnetwork which gets completely removed:
graph.edge(5, 10, 510, true);
graph.markNodeRemoved(3);
graph.markNodeRemoved(4);
graph.markNodeRemoved(5);
graph.markNodeRemoved(10);
graph.edge(9, 11, 911, true);
graph.edge(7, 9, 78, true);
graph.edge(8, 9, 89, true);
// perform deletion
graph.optimize();
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
assertEquals(3, GHUtility.count(carAllExplorer.setBaseNode(getIdOf(graph, 9))));
assertEquals(1, GHUtility.count(carAllExplorer.setBaseNode(getIdOf(graph, 7))));
assertEquals(1, GHUtility.count(carAllExplorer.setBaseNode(getIdOf(graph, 8))));
assertEquals(1, GHUtility.count(carAllExplorer.setBaseNode(getIdOf(graph, 11))));
}
public void testDeleteNodes(int fillToSize) {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
na.setNode(0, 12, 23);
na.setNode(1, 38.33f, 135.3f);
na.setNode(2, 3, 3);
na.setNode(3, 78, 89);
na.setNode(4, 2, 1);
na.setNode(5, 2.5f, 1);
int deleted = 2;
for (int i = 6; i < fillToSize; i++) {
na.setNode(i, i * 1.5, i * 1.6);
if (i % 3 == 0) {
graph.markNodeRemoved(i);
deleted++;
} else {
// connect to
// ... a deleted node
graph.edge(i, 0, 10 * i, true);
// ... a non-deleted and non-moved node
graph.edge(i, 2, 10 * i, true);
// ... a moved node
graph.edge(i, fillToSize - 1, 10 * i, true);
}
}
graph.edge(0, 1, 10, true);
graph.edge(0, 3, 20, false);
graph.edge(3, 5, 20, true);
graph.edge(1, 5, 20, false);
graph.markNodeRemoved(0);
graph.markNodeRemoved(2);
// no deletion happend
assertEquals(fillToSize, graph.getNodes());
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
// now actually perform deletion
graph.optimize();
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
assertEquals(fillToSize - deleted, graph.getNodes());
int id1 = getIdOf(graph, 38.33f);
assertEquals(135.3f, na.getLongitude(id1), 1e-4);
assertTrue(containsLatitude(graph, carAllExplorer.setBaseNode(id1), 2.5));
assertFalse(containsLatitude(graph, carAllExplorer.setBaseNode(id1), 12));
int id3 = getIdOf(graph, 78);
assertEquals(89, na.getLongitude(id3), 1e-4);
assertTrue(containsLatitude(graph, carAllExplorer.setBaseNode(id3), 2.5));
assertFalse(containsLatitude(graph, carAllExplorer.setBaseNode(id3), 12));
}
private void optimize() {
logger.info("optimizing ... (" + Helper.getMemInfo() + ")");
graph.optimize();
logger.info("finished optimize (" + Helper.getMemInfo() + ")");
// move this into the GraphStorage.optimize method?
if (sortGraph) {
logger.info("sorting ... (" + Helper.getMemInfo() + ")");
GraphStorage newGraph = GHUtility.newStorage(graph);
GHUtility.sortDFS(graph, newGraph);
graph = newGraph;
}
}
@Test
public void testDeleteNodeForUnidir() {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
na.setNode(10, 10, 1);
na.setNode(6, 6, 1);
na.setNode(20, 20, 1);
na.setNode(21, 21, 1);
graph.edge(10, 20, 10, false);
graph.edge(21, 6, 10, false);
graph.markNodeRemoved(0);
graph.markNodeRemoved(7);
assertEquals(22, graph.getNodes());
graph.optimize();
assertEquals(20, graph.getNodes());
assertEquals(1, GHUtility.count(carInExplorer.setBaseNode(getIdOf(graph, 20))));
assertEquals(0, GHUtility.count(carOutExplorer.setBaseNode(getIdOf(graph, 20))));
assertEquals(1, GHUtility.count(carOutExplorer.setBaseNode(getIdOf(graph, 10))));
assertEquals(0, GHUtility.count(carInExplorer.setBaseNode(getIdOf(graph, 10))));
assertEquals(1, GHUtility.count(carInExplorer.setBaseNode(getIdOf(graph, 6))));
assertEquals(0, GHUtility.count(carOutExplorer.setBaseNode(getIdOf(graph, 6))));
assertEquals(1, GHUtility.count(carOutExplorer.setBaseNode(getIdOf(graph, 21))));
assertEquals(0, GHUtility.count(carInExplorer.setBaseNode(getIdOf(graph, 21))));
}
@Test
public void testFootMix() {
graph = createGraph();
graph.edge(0, 1).setDistance(10).setFlags(footEncoder.setProperties(10, true, true));
graph.edge(0, 2).setDistance(10).setFlags(carEncoder.setProperties(10, true, true));
graph
.edge(0, 3)
.setDistance(10)
.setFlags(
footEncoder.setProperties(10, true, true) | carEncoder.setProperties(10, true, true));
EdgeExplorer footOutExplorer =
graph.createEdgeExplorer(new DefaultEdgeFilter(footEncoder, false, true));
assertEquals(GHUtility.asSet(3, 1), GHUtility.getNeighbors(footOutExplorer.setBaseNode(0)));
assertEquals(GHUtility.asSet(3, 2), GHUtility.getNeighbors(carOutExplorer.setBaseNode(0)));
}
@Test
public void testDetachEdge() {
graph = createGraph();
graph.edge(0, 1, 2, true);
long flags = carEncoder.setProperties(10, true, false);
graph.edge(0, 2, 2, true).setWayGeometry(Helper.createPointList(1, 2, 3, 4)).setFlags(flags);
graph.edge(1, 2, 2, true);
EdgeIterator iter = graph.createEdgeExplorer().setBaseNode(0);
try {
// currently not possible to detach without next, without introducing a new property inside
// EdgeIterable
iter.detach(false);
assertTrue(false);
} catch (Exception ex) {
}
iter.next();
EdgeIteratorState edgeState2 = iter.detach(false);
assertEquals(2, iter.getAdjNode());
assertEquals(1, edgeState2.fetchWayGeometry(0).getLatitude(0), 1e-1);
assertEquals(2, edgeState2.getAdjNode());
assertTrue(carEncoder.isBool(edgeState2.getFlags(), FlagEncoder.K_FORWARD));
EdgeIteratorState edgeState3 = iter.detach(true);
assertEquals(0, edgeState3.getAdjNode());
assertEquals(2, edgeState3.getBaseNode());
assertEquals(3, edgeState3.fetchWayGeometry(0).getLatitude(0), 1e-1);
assertFalse(carEncoder.isBool(edgeState3.getFlags(), FlagEncoder.K_FORWARD));
assertEquals(GHUtility.getEdge(graph, 0, 2).getFlags(), edgeState2.getFlags());
assertEquals(GHUtility.getEdge(graph, 2, 0).getFlags(), edgeState3.getFlags());
iter.next();
assertEquals(1, iter.getAdjNode());
assertEquals(2, edgeState2.getAdjNode());
assertEquals(2, edgeState3.getBaseNode());
assertEquals(0, iter.fetchWayGeometry(0).size());
assertEquals(1, edgeState2.fetchWayGeometry(0).getLatitude(0), 1e-1);
assertEquals(3, edgeState3.fetchWayGeometry(0).getLatitude(0), 1e-1);
// #162 a directed self referencing edge should be able to reverse its state too
graph.edge(3, 3, 2, true).setFlags(flags);
EdgeIterator iter2 = graph.createEdgeExplorer().setBaseNode(3);
iter2.next();
assertEquals(edgeState2.getFlags(), iter2.detach(false).getFlags());
assertEquals(edgeState3.getFlags(), iter2.detach(true).getFlags());
}
@Test
public void testIdenticalNodes2() {
graph = createGraph();
graph.edge(0, 0, 100, false);
graph.edge(0, 0, 100, false);
assertEquals(2, GHUtility.count(carAllExplorer.setBaseNode(0)));
}
@Test
public void testUnidirectionalEdgeFilter() {
graph = createGraph();
graph.edge(1, 2, 12, false);
graph.edge(1, 11, 12, false);
graph.edge(11, 1, 12, false);
graph.edge(1, 12, 12, false);
graph.edge(3, 2, 112, false);
EdgeIterator i = carOutExplorer.setBaseNode(2);
assertFalse(i.next());
assertEquals(4, GHUtility.count(carAllExplorer.setBaseNode(1)));
assertEquals(1, GHUtility.count(carInExplorer.setBaseNode(1)));
assertEquals(2, GHUtility.count(carInExplorer.setBaseNode(2)));
assertEquals(0, GHUtility.count(carInExplorer.setBaseNode(3)));
assertEquals(3, GHUtility.count(carOutExplorer.setBaseNode(1)));
assertEquals(0, GHUtility.count(carOutExplorer.setBaseNode(2)));
assertEquals(1, GHUtility.count(carOutExplorer.setBaseNode(3)));
i = carOutExplorer.setBaseNode(3);
i.next();
assertEquals(2, i.getAdjNode());
i = carOutExplorer.setBaseNode(1);
assertTrue(i.next());
assertEquals(12, i.getAdjNode());
assertTrue(i.next());
assertEquals(11, i.getAdjNode());
assertTrue(i.next());
assertEquals(2, i.getAdjNode());
assertFalse(i.next());
}
@Test
public void testSetNodes() {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
for (int i = 0; i < defaultSize * 2; i++) {
na.setNode(i, 2 * i, 3 * i);
}
graph.edge(defaultSize + 1, defaultSize + 2, 10, true);
graph.edge(defaultSize + 1, defaultSize + 3, 10, true);
assertEquals(2, GHUtility.count(carAllExplorer.setBaseNode(defaultSize + 1)));
}
@Test
public void testEnabledElevation() {
graph = createGraph(defaultGraphLoc, true);
NodeAccess na = graph.getNodeAccess();
assertTrue(na.is3D());
na.setNode(0, 10, 20, -10);
na.setNode(1, 11, 2, 100);
assertEquals(-10, na.getEle(0), 1e-1);
assertEquals(100, na.getEle(1), 1e-1);
graph.edge(0, 1).setWayGeometry(Helper.createPointList3D(10, 27, 72, 11, 20, 1));
assertEquals(
Helper.createPointList3D(10, 27, 72, 11, 20, 1),
GHUtility.getEdge(graph, 0, 1).fetchWayGeometry(0));
assertEquals(
Helper.createPointList3D(10, 20, -10, 10, 27, 72, 11, 20, 1, 11, 2, 100),
GHUtility.getEdge(graph, 0, 1).fetchWayGeometry(3));
assertEquals(
Helper.createPointList3D(11, 2, 100, 11, 20, 1, 10, 27, 72, 10, 20, -10),
GHUtility.getEdge(graph, 1, 0).fetchWayGeometry(3));
}
@Test
public void testCreateDuplicateEdges() {
graph = createGraph();
graph.edge(2, 1, 12, true);
graph.edge(2, 3, 12, true);
graph.edge(2, 3, 13, false);
assertEquals(3, GHUtility.count(carOutExplorer.setBaseNode(2)));
// no exception
graph.getEdgeProps(1, 3);
// raise exception
try {
graph.getEdgeProps(4, 3);
assertTrue(false);
} catch (Exception ex) {
}
try {
graph.getEdgeProps(-1, 3);
assertTrue(false);
} catch (Exception ex) {
}
EdgeIterator iter = carOutExplorer.setBaseNode(2);
assertTrue(iter.next());
EdgeIteratorState oneIter = graph.getEdgeProps(iter.getEdge(), 3);
assertEquals(13, oneIter.getDistance(), 1e-6);
assertEquals(2, oneIter.getBaseNode());
assertTrue(carEncoder.isBool(oneIter.getFlags(), FlagEncoder.K_FORWARD));
assertFalse(carEncoder.isBool(oneIter.getFlags(), FlagEncoder.K_BACKWARD));
oneIter = graph.getEdgeProps(iter.getEdge(), 2);
assertEquals(13, oneIter.getDistance(), 1e-6);
assertEquals(3, oneIter.getBaseNode());
assertFalse(carEncoder.isBool(oneIter.getFlags(), FlagEncoder.K_FORWARD));
assertTrue(carEncoder.isBool(oneIter.getFlags(), FlagEncoder.K_BACKWARD));
graph.edge(3, 2, 14, true);
assertEquals(4, GHUtility.count(carOutExplorer.setBaseNode(2)));
}
@Test
public void testSimpleDelete2() {
graph = createGraph();
NodeAccess na = graph.getNodeAccess();
assertEquals(-1, getIdOf(graph, 12));
na.setNode(9, 9, 1);
assertEquals(-1, getIdOf(graph, 12));
na.setNode(11, 11, 1);
na.setNode(12, 12, 1);
// mini subnetwork which gets completely removed:
graph.edge(5, 10, 510, true);
graph.markNodeRemoved(5);
graph.markNodeRemoved(10);
PointList pl = new PointList();
pl.add(1, 2, Double.NaN);
pl.add(1, 3, Double.NaN);
graph.edge(9, 11, 911, true).setWayGeometry(pl);
graph.edge(9, 12, 912, true).setWayGeometry(pl);
assertEquals(13, graph.getNodes());
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
// perform deletion
graph.optimize();
assertEquals(11, graph.getNodes());
assertEquals(Arrays.<String>asList(), GHUtility.getProblems(graph));
int id11 = getIdOf(graph, 11); // is now 10
int id12 = getIdOf(graph, 12); // is now 5
int id9 = getIdOf(graph, 9); // is now 9
assertEquals(
GHUtility.asSet(id12, id11), GHUtility.getNeighbors(carAllExplorer.setBaseNode(id9)));
assertEquals(GHUtility.asSet(id9), GHUtility.getNeighbors(carAllExplorer.setBaseNode(id11)));
assertEquals(GHUtility.asSet(id9), GHUtility.getNeighbors(carAllExplorer.setBaseNode(id12)));
EdgeIterator iter = carAllExplorer.setBaseNode(id9);
assertTrue(iter.next());
assertEquals(id12, iter.getAdjNode());
assertEquals(2, iter.fetchWayGeometry(0).getLongitude(0), 1e-7);
assertTrue(iter.next());
assertEquals(id11, iter.getAdjNode());
assertEquals(2, iter.fetchWayGeometry(0).getLongitude(0), 1e-7);
}
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) {
}
}