Class EppsteinShortestPathIterator.EppsteinGraphPath

    • Field Detail

      • graph

        private Graph<V,​E> graph
        The graph.
      • distanceAndPredecessorMap

        private java.util.Map<V,​Pair<java.lang.Double,​E>> distanceAndPredecessorMap
        Shortest paths tree in the edge reversed graph graph rooted at sink.
      • weight

        private double weight
        Weight of tha path.
    • Method Detail

      • getGraph

        public Graph<V,​E> getGraph()
        Description copied from interface: GraphPath
        Returns the graph over which this path is defined. The path may also be valid with respect to other graphs.
        Specified by:
        getGraph in interface GraphPath<V,​E>
        Returns:
        the containing graph
      • getStartVertex

        public V getStartVertex()
        Description copied from interface: GraphPath
        Returns the start vertex in the path.
        Specified by:
        getStartVertex in interface GraphPath<V,​E>
        Returns:
        the start vertex
      • getEndVertex

        public V getEndVertex()
        Description copied from interface: GraphPath
        Returns the end vertex in the path.
        Specified by:
        getEndVertex in interface GraphPath<V,​E>
        Returns:
        the end vertex
      • getWeight

        public double getWeight()
        Description copied from interface: GraphPath
        Returns the weight assigned to the path. Typically, this will be the sum of the weights of the edge list entries (as defined by the containing graph), but some path implementations may use other definitions.
        Specified by:
        getWeight in interface GraphPath<V,​E>
        Returns:
        the weight of the path
      • getEdgeList

        public java.util.List<E> getEdgeList()
        Given the implicit representation of the path between source and sink constructs the edge list of the path.
        Specified by:
        getEdgeList in interface GraphPath<V,​E>
        Returns:
        edge list of the path