Class YenShortestPathIterator.YenShortestPathsTree

    • Field Summary

      Fields 
      Modifier and Type Field Description
      (package private) java.util.Set<E> maskedEdges
      Edges which are masked in the g.
      (package private) java.util.Set<V> maskedVertices
      Vertices which are masked in the g.
    • Constructor Summary

      Constructors 
      Constructor Description
      YenShortestPathsTree​(Graph<V,​E> maskSubgraph, java.util.Set<V> maskedVertices, java.util.Set<E> maskedEdges, java.util.Map<V,​Pair<java.lang.Double,​E>> reversedTree, V treeSource)
      Constructs an instance of the shortest paths tree for the given maskSubgraph, maskedVertices, maskedEdges, reversedTree, treeSource.
    • Field Detail

      • maskedVertices

        java.util.Set<V> maskedVertices
        Vertices which are masked in the g.
      • maskedEdges

        java.util.Set<E> maskedEdges
        Edges which are masked in the g.
    • Constructor Detail

      • YenShortestPathsTree

        YenShortestPathsTree​(Graph<V,​E> maskSubgraph,
                             java.util.Set<V> maskedVertices,
                             java.util.Set<E> maskedEdges,
                             java.util.Map<V,​Pair<java.lang.Double,​E>> reversedTree,
                             V treeSource)
        Constructs an instance of the shortest paths tree for the given maskSubgraph, maskedVertices, maskedEdges, reversedTree, treeSource.
        Parameters:
        maskSubgraph - graph which has removed vertices and edges
        maskedVertices - vertices removed form the graph
        maskedEdges - edges removed from the graph
        reversedTree - shortest path tree in the edge reversed maskSubgraph starting at treeSource.
        treeSource - source vertex of the reversedTree
    • Method Detail

      • recoverVertex

        void recoverVertex​(V v)
        Restores vertex v in the g.
        Parameters:
        v - vertex to be recovered
      • recoverEdge

        void recoverEdge​(E e)
        Restores edge e in the g.
        Parameters:
        e - edge to be recovered
      • correctDistanceForward

        void correctDistanceForward​(V v)
        Updates the distance of provided vertex v in the shortest paths tree based on the current distances of its successors in the g.
        Parameters:
        v - vertex which should be updated
      • correctDistanceBackward

        void correctDistanceBackward​(V v)
        Updates the distance of relevant predecessors of the input vertex.
        Parameters:
        v - vertex which distance should be updated