dijkstra: Weighted Shortest Paths

In nicolewhite/RNeo4j: Neo4j Driver for R

Description

Deprecated. Use shortestPath. Retrieve the shortest path between two nodes weighted by a cost property.

Usage

dijkstra(fromNode, relType, toNode, cost_property = character(),
  direction = "out")

Arguments

fromNode	A node object.
relType	A character string. The relationship type to traverse.
toNode	A node object.
cost_property	A character string. If retrieving a weighted shortest path, the name of the relationship property that contains the weights.
direction	A character string. The relationship direction to traverse. Should be "in" or "out".

Value

A path object.

See Also

allDijkstra

Examples

## Not run: 
graph = startGraph("http://localhost:7474/db/data/")
clear(graph)

alice = createNode(graph, "Person", name = "Alice")
bob = createNode(graph, "Person", name = "Bob")
charles = createNode(graph, "Person", name = "Charles")
david = createNode(graph, "Person", name = "David")
elaine = createNode(graph, "Person", name = "Elaine")

r1 = createRel(alice, "KNOWS", bob, weight=1.5)
r2 = createRel(bob, "KNOWS", charles, weight=2)
r3 = createRel(bob, "KNOWS", david, weight=4)
r4 = createRel(charles, "KNOWS", david, weight=1)
r5 = createRel(alice, "KNOWS", elaine, weight=2)
r6 = createRel(elaine, "KNOWS", david, weight=2.5)

p = dijkstra(alice, "KNOWS", david, cost_property="weight")

p$length
p$weight
nodes(p)

## End(Not run)

nicolewhite/RNeo4j documentation built on May 23, 2019, 5:09 p.m.