/*
* Copyright 2008 Network Engine for Objects in Lund AB [neotechnology.com]
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.graphalgo.benchmark;
import org.neo4j.api.core.Direction;
import org.neo4j.api.core.Node;
import org.neo4j.api.core.Relationship;
import org.neo4j.api.core.RelationshipType;
import org.neo4j.api.core.Transaction;
import org.neo4j.graphalgo.benchmark.graphgeneration.GeneratedGraph;
import org.neo4j.graphalgo.benchmark.graphgeneration.GraphStore;
import org.neo4j.graphalgo.benchmark.graphgeneration.PreferentialAttachment;
import org.neo4j.graphalgo.benchmark.graphgeneration.RandomGraph;
import org.neo4j.graphalgo.benchmark.graphgeneration.SmallWorldGraph;
import org.neo4j.graphalgo.shortestpath.CostEvaluator;
import org.neo4j.graphalgo.shortestpath.SingleSourceShortestPathDijkstra;
import org.neo4j.graphalgo.shortestpath.std.IntegerAdder;
import org.neo4j.graphalgo.shortestpath.std.IntegerComparator;
public class SingleSourceShortestPathDijkstraBenchmark extends NeoAlgoBenchmark
{
public static void main( String args[] )
{
// hack to avoid static
new SingleSourceShortestPathDijkstraBenchmark().neoAlgoBenchMarkRun();
}
protected static enum MyRelTypes implements RelationshipType
{
R1
}
Node startNode;
GeneratedGraph graph;
@Override
public String getTestId()
{
return "SingleSourceShortestPathDijkstraBenchmark";
}
@Override
protected void setUpGlobal()
{
super.setUpGlobal();
RandomGraph graph1;
SmallWorldGraph graph2;
PreferentialAttachment graph3;
// graph = new RandomGraph( neo, new GraphStore( neo ), MyRelTypes.R1,
// 100000, 1000000 );
// graph = new SmallWorldGraph( neo, new GraphStore( neo ),
// MyRelTypes.R1,
// 100000, 10, 0.25, true, true );
graph = new PreferentialAttachment( neo, new GraphStore( neo ),
MyRelTypes.R1, 100000, 10 );
numberOfRuns = 10;
}
@Override
protected void setUp()
{
}
@Override
protected void tearDown()
{
}
@Override
protected void runBenchMark()
{
Transaction tx = neo.beginTx();
startNode = graph.getRandomNode( null );
new SingleSourceShortestPathDijkstra<Integer>( 0, startNode,
new CostEvaluator<Integer>()
{
public Integer getCost( Relationship relationship,
boolean backwards )
{
return 1;
}
}, new IntegerAdder(), new IntegerComparator(), Direction.BOTH,
MyRelTypes.R1 ).calculate();
tx.finish();
}
}