Class DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl

    • Field Detail

      • reversed

        private boolean reversed
        Indicates is the search spaces were computed on the edge reversed graph.
    • Constructor Detail

      • DijkstraManyToManyShortestPathsImpl

        DijkstraManyToManyShortestPathsImpl​(java.util.Set<V> sources,
                                            java.util.Set<V> targets,
                                            boolean reversed,
                                            java.util.Map<V,​ShortestPathAlgorithm.SingleSourcePaths<V,​E>> searchSpaces)
        Constructs an instance of the algorithm for the given sources, targets, reversed and searchSpaces.
        Parameters:
        sources - source vertices
        targets - target vertices
        reversed - if search spaces are reversed
        searchSpaces - single source shortest paths trees map
    • Method Detail

      • getPath

        public GraphPath<V,​E> getPath​(V source,
                                            V target)
        Return the path from the source vertex to the target vertex. If no such path exists, null is returned.
        Parameters:
        source - source vertex
        target - target vertex
        Returns:
        path between source and target or null if no such path exists
      • getWeight

        public double getWeight​(V source,
                                V target)
        Return the weight of the path from the source vertex to the targetvertex or Double.POSITIVE_INFINITY if there is no such path in the graph. The weight of the path between a vertex and itself is always zero.
        Parameters:
        source - source vertex
        target - target vertex
        Returns:
        the weight of the path between source and sink vertices or Double.POSITIVE_INFINITY in case no such path exists