Package org.neo4j.graphalgo.impl.shortestpath

Package containing older implementations of Dijkstra and shortest path, where the ones in GraphAlgoFactory would be a better option.

See:
Description

Interface Summary

DijkstraPriorityQueue<CostType>	Abstraction of the priority queue used by Dijkstra in order to make (testing of) alternative implementations easier.
SingleSourceShortestPath<CostType>	An object implementing this encapsulates an algorithm able to solve the single source shortest path problem.
SingleSourceSingleSinkShortestPath<CostType>	An object implementing this encapsulates an algorithm able to solve the single source single sink shortest path problem.

Class Summary

Dijkstra<CostType>	Dijkstra class.
DijkstraPriorityQueueFibonacciImpl<CostType>	Implementation of DijkstraPriorityQueue using a FibonacciHeap
DijkstraPriorityQueueImpl<CostType>	Implementation of DijkstraPriorityQueue with just a normal java priority queue.
FloydWarshall<CostType>	This provides an implementation of the Floyd Warshall algorithm solving the all pair shortest path problem.
SingleSourceShortestPathBFS	Breadth first search to find all shortest uniform paths from a node to all others.
SingleSourceShortestPathDijkstra<CostType>	Dijkstra implementation to solve the single source shortest path problem for weighted networks.
Util	This is a holder for some utility functions regarding paths, such as constructing them from sets of predecessors or counting them.
Util.PathCounter	This can be used for counting the number of paths from the start node (implicit from the predecessors) and some target nodes.

Package org.neo4j.graphalgo.impl.shortestpath Description

Package containing older implementations of Dijkstra and shortest path, where the ones in GraphAlgoFactory would be a better option. Also contains algorithms, such as FloydWarshall which doesn't scale to bigger graphs.