Class EppsteinKShortestPath<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:

    public class EppsteinKShortestPath<V,​E>
    extends Object
    implements KShortestPathAlgorithm<V,​E>
    Implementation of the Eppstein`s algorithm for finding $k$ shortest path between two vertices in a graph.

    The algorithm is originally described in: David Eppstein. 1999. Finding the k Shortest Paths. SIAM J. Comput. 28, 2 (February 1999), 652-673. DOI=

    The main advantage ot this algorithm is that it achieves the complexity of $O(m + n\log n + k\log k)$ while guaranteeing that the paths are produced in sorted order by weight, where $m$ is the number of edges in the graph, $n$ is the number of vertices in the graph and $k$ is the number of paths needed.

    This implementation can only be used for directed simple graphs.

    Semen Chudakov
    See Also:
    • Constructor Detail

      • EppsteinKShortestPath

        public EppsteinKShortestPath​(Graph<V,​E> graph)
        Constructs the algorithm instance for the given graph.
        graph - graph
    • Method Detail

      • getPaths

        public List<GraphPath<V,​E>> getPaths​(V source,
                                                   V sink,
                                                   int k)
        Computes k shortest paths between source and sink. If the number of paths is denoted by $n$, the method returns $m = min\{k, n\}$ such paths. The paths are produced in sorted order by weights.
        Specified by:
        getPaths in interface KShortestPathAlgorithm<V,​E>
        source - the source vertex
        sink - the target vertex
        k - the number of shortest paths to return
        a list of k shortest paths