Uses of Package
org.neo4j.graphalgo.impl.shortestpath

Packages that use org.neo4j.graphalgo.impl.shortestpath

org.neo4j.graphalgo.impl.centrality	Centrality graph algorithms which are allright to use, but doesn't scale to bigger graphs.
org.neo4j.graphalgo.impl.shortestpath	Package containing older implementations of Dijkstra and shortest path, where the ones in GraphAlgoFactory would be a better option.

Classes in org.neo4j.graphalgo.impl.shortestpath used by org.neo4j.graphalgo.impl.centrality

SingleSourceShortestPath
An object implementing this encapsulates an algorithm able to solve the single source shortest path problem.

Util.PathCounter
This can be used for counting the number of paths from the start node (implicit from the predecessors) and some target nodes.

Classes in org.neo4j.graphalgo.impl.shortestpath used by org.neo4j.graphalgo.impl.shortestpath

Dijkstra
Dijkstra class.

DijkstraPriorityQueue
Abstraction of the priority queue used by Dijkstra in order to make (testing of) alternative implementations easier.

SingleSourceShortestPath
An object implementing this encapsulates an algorithm able to solve the single source shortest path problem.

SingleSourceSingleSinkShortestPath
An object implementing this encapsulates an algorithm able to solve the single source single sink shortest path problem.