Package org.goplanit.algorithms.shortest

Interface ShortestPathAllToOne

  • All Known Implementing Classes:
    ShortestPathAcyclicMinMaxGeneralised, ShortestPathDijkstra
    public interface ShortestPathAllToOne
    An algorithm which calculates the shortest (a.k.a. lowest cost) path to all vertices from a given origin vertex for a directed graph in upstream direction
    Author:
    markr

    • Method Detail

      • executeAllToOne

        ShortestPathResult executeAllToOne​(DirectedVertex currentDestination)
        Construct shortest paths from all nodes to a destination node in the network based on directed LinkSegment edges
        Parameters:
        currentDestination - destination vertex to which all paths go
        Returns:
        shortest path result that can be used to extract paths