Interface KShortestPathAlgorithm<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Known Implementing Classes:
    KShortestPaths

    public interface KShortestPathAlgorithm<V,​E>
    An algorithm which computes k-shortest paths between vertices.
    • Method Detail

      • getPaths

        java.util.List<GraphPath<V,​E>> getPaths​(V source,
                                                      V sink)
        Get a list of shortest paths from a source vertex to a sink vertex. If no such paths exist this method returns an empty list.
        Parameters:
        source - the source vertex
        sink - the target vertex
        Returns:
        a list of shortest paths