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);
}
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 testClone() {
graph = createGraph();
graph.edge(1, 2, 10, true);
NodeAccess na = graph.getNodeAccess();
na.setNode(0, 12, 23);
na.setNode(1, 8, 13);
na.setNode(2, 2, 10);
na.setNode(3, 5, 9);
graph.edge(1, 3, 10, true);
Graph clone = graph.copyTo(createGraph(locationParent + "/clone", false));
assertEquals(graph.getNodes(), clone.getNodes());
assertEquals(
count(carOutExplorer.setBaseNode(1)),
count(clone.createEdgeExplorer(carOutFilter).setBaseNode(1)));
clone.edge(1, 4, 10, true);
assertEquals(3, count(clone.createEdgeExplorer(carOutFilter).setBaseNode(1)));
assertEquals(graph.getBounds(), clone.getBounds());
Helper.close((Closeable) clone);
}
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;
}
