-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
AStarPerformanceIT.java
102 lines (91 loc) · 3.48 KB
/
AStarPerformanceIT.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/*
* Copyright (c) 2002-2017 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.graphalgo.path;
import org.junit.Before;
import org.junit.Ignore;
import org.junit.Rule;
import org.junit.Test;
import java.io.File;
import org.neo4j.graphalgo.PathFinder;
import org.neo4j.graphalgo.WeightedPath;
import org.neo4j.graphdb.GraphDatabaseService;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.Transaction;
import org.neo4j.test.TestGraphDatabaseFactory;
import org.neo4j.test.rule.TestDirectory;
import static java.lang.System.currentTimeMillis;
import static org.neo4j.graphalgo.CommonEvaluators.doubleCostEvaluator;
import static org.neo4j.graphalgo.GraphAlgoFactory.aStar;
import static org.neo4j.graphdb.PathExpanders.allTypesAndDirections;
@Ignore( "Not a test, just nice to have" )
public class AStarPerformanceIT
{
private File directory;
@Rule
public TestDirectory testDirectory = TestDirectory.testDirectory();
@Before
public void setup()
{
directory = testDirectory.graphDbDir();
}
@Test
public void somePerformanceTesting() throws Exception
{
// GIVEN
int numberOfNodes = 200000;
GeoDataGenerator generator = new GeoDataGenerator( numberOfNodes, 5d, 1000, 1000 );
generator.generate( directory );
// WHEN
long[][] points = new long[][]{
new long[]{9415, 158154},
new long[]{89237, 192863},
new long[]{68072, 150484},
new long[]{186309, 194495},
new long[]{152097, 99289},
new long[]{92150, 161182},
new long[]{188446, 115873},
new long[]{85033, 7772},
new long[]{291, 86707},
new long[]{188345, 158468}
};
GraphDatabaseService db = new TestGraphDatabaseFactory().newEmbeddedDatabase( directory.getAbsoluteFile() );
PathFinder<WeightedPath> algo = aStar( allTypesAndDirections(),
doubleCostEvaluator( "weight", 0 ), GeoDataGenerator.estimateEvaluator() );
for ( int i = 0; i < 10; i++ )
{
System.out.println( "----- " + i );
for ( long[] p : points )
{
try ( Transaction tx = db.beginTx() )
{
Node start = db.getNodeById( p[0] );
Node end = db.getNodeById( p[1] );
long time = currentTimeMillis();
WeightedPath path = algo.findSinglePath( start, end );
time = currentTimeMillis() - time;
System.out.println( "time: " + time + ", len:" + path.length() + ", weight:" + path.weight() );
tx.success();
}
}
}
// THEN
db.shutdown();
}
}