Uses of Interface
org.neo4j.graphalgo.WeightedPath

Packages that use WeightedPath

org.neo4j.graphalgo	Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via GraphAlgoFactory.
org.neo4j.graphalgo.impl.path
org.neo4j.graphalgo.impl.util

Uses of WeightedPath in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo that return types with arguments of type WeightedPath

static PathFinder<WeightedPath>	GraphAlgoFactory.aStar(RelationshipExpander expander, CostEvaluator<Double> lengthEvaluator, EstimateEvaluator<Double> estimateEvaluator) Returns an PathFinder which uses the A* algorithm to find the cheapest path between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(RelationshipExpander expander, CostEvaluator<Double> costEvaluator) Returns an PathFinder which uses the Dijkstra algorithm to find the cheapest path between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(RelationshipExpander expander, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).

Uses of WeightedPath in org.neo4j.graphalgo.impl.path

Methods in org.neo4j.graphalgo.impl.path that return WeightedPath

WeightedPath	Dijkstra.findSinglePath(Node start, Node end)
WeightedPath	ExperimentalAStar.findSinglePath(Node start, Node end)
WeightedPath	AStar.findSinglePath(Node start, Node end)

Methods in org.neo4j.graphalgo.impl.path that return types with arguments of type WeightedPath

Iterable<WeightedPath>	Dijkstra.findAllPaths(Node start, Node end)
Iterable<WeightedPath>	ExperimentalAStar.findAllPaths(Node start, Node end)
Iterable<WeightedPath>	AStar.findAllPaths(Node node, Node end)

Uses of WeightedPath in org.neo4j.graphalgo.impl.util

Classes in org.neo4j.graphalgo.impl.util that implement WeightedPath

class

WeightedPathImpl

Methods in org.neo4j.graphalgo.impl.util that return WeightedPath

protected WeightedPath

StopAfterWeightIterator.fetchNextOrNull()