AlgoShortest
AlgoShortest
Holds the parameters for finding a path between two nodes
__construct(\Everyman\Neo4j\Client $client)
Build the finder and set its client
| \Everyman\Neo4j\Client | $client |
getClient() : \Everyman\Neo4j\Client
Get the finder's client
getEndNode() : \Everyman\Neo4j\Node
Get the end node
getSinglePath() : \Everyman\Neo4j\Path
Get a single path
getStartNode() : \Everyman\Neo4j\Node
Get the start node
setAlgorithm(string $algo) : \Everyman\Neo4j\PathFinder
Set the algorithm to use
| string | $algo |
setCostProperty(string $property) : \Everyman\Neo4j\PathFinder
Set the cost property name for the Dijkstra search
| string | $property |
setDefaultCost(\Everyman\Neo4j\numeric $cost) : \Everyman\Neo4j\PathFinder
Set the default relationship cost for the Dijkstra search
| \Everyman\Neo4j\numeric | $cost |
setDirection(string $dir) : \Everyman\Neo4j\PathFinder
Set the direction of the path
| string | $dir |
setEndNode(\Everyman\Neo4j\Node $end) : \Everyman\Neo4j\PathFinder
Set the end node
| \Everyman\Neo4j\Node | $end |
setMaxDepth(integer $max) : \Everyman\Neo4j\PathFinder
Set the maximum allowed path length
| integer | $max |
setStartNode(\Everyman\Neo4j\Node $start) : \Everyman\Neo4j\PathFinder
Set the start node
| \Everyman\Neo4j\Node | $start |
setType(string $type) : \Everyman\Neo4j\PathFinder
Set the type
| string | $type |