Package org.goplanit.algorithms.shortest

Interface ShortestBushAllToOne

  • All Known Implementing Classes:
    ShortestBushGeneralised
    public interface ShortestBushAllToOne
    An algorithm which calculates the shortest (a.k.a. lowest cost) bush from all vertices to a given end vertex for a directed graph in upstream direction
    Author:
    markr

    • Method Detail

      • executeAllToOne

        ShortestBushResult executeAllToOne​(DirectedVertex currentDestination)
        Construct shortest bush result from any node to a sink node based on directed LinkSegment edges
        Parameters:
        currentDestination - destination vertex
        Returns:
        shortest bush result that can be used to extract bushes