1 package org.openkilda.neo;
4 import org.neo4j.graphalgo.CommonEvaluators;
5 import org.neo4j.graphalgo.impl.shortestpath.Dijkstra;
6 import org.neo4j.graphdb.Direction;
7 import org.neo4j.graphdb.GraphDatabaseService;
8 import org.neo4j.graphdb.Relationship;
9 import org.neo4j.graphdb.RelationshipType;
20 GraphDatabaseService graphDb;
22 public NeoUtils (GraphDatabaseService graphDb) {
23 this.graphDb = graphDb;
34 for ( Map.Entry<String, Object> property : properties.entrySet() )
42 return new OkNode(graphDb.createNode());
51 public Dijkstra<Double>
getDijkstra(Double startCost, RelationshipType rt, String property,
OkNode startNode,
OkNode endNode) {
52 return new Dijkstra<Double>(
56 CommonEvaluators.doubleCostEvaluator( property ),
57 new org.neo4j.graphalgo.impl.util.DoubleAdder(),
58 new org.neo4j.graphalgo.impl.util.DoubleComparator(),
68 public enum OkRels implements RelationshipType
77 public static class OkEdge {
79 public Relationship
edge;
81 public OkEdge (Relationship
edge){
85 public OkEdge property(String s, Object o) {
86 edge.setProperty(s,o);
void isl(OkNode a, OkNode b)
OkNode property(String s, Object o)
NeoUtils.OkEdge edge(RelationshipType r, OkNode other)
Dijkstra< Double > getDijkstra(Double startCost, RelationshipType rt, String property, OkNode startNode, OkNode endNode)
OkNode node(Map< String, Object > properties)
NeoUtils(GraphDatabaseService graphDb)