Class DefaultManyToManyShortestPaths<V,​E>

    • Constructor Detail

      • DefaultManyToManyShortestPaths

        public DefaultManyToManyShortestPaths​(Graph<V,​E> graph)
        Constructs a new instance of the algorithm for a given graph. The function is defaulted to returning BidirectionalDijkstraShortestPath.
        Parameters:
        graph - a graph
      • DefaultManyToManyShortestPaths

        public DefaultManyToManyShortestPaths​(Graph<V,​E> graph,
                                              java.util.function.Function<Graph<V,​E>,​ShortestPathAlgorithm<V,​E>> function)
        Constructs a new instance of the algorithm for a given graph and function.
        Parameters:
        graph - a graph
        function - provides implementation of ShortestPathAlgorithm