Interface MultiObjectiveShortestPathAlgorithm<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Known Implementing Classes:
    MartinShortestPath

    public interface MultiObjectiveShortestPathAlgorithm<V,​E>
    An algorithm which computes multi-objective shortest paths between vertices.
    Author:
    Dimitrios Michail
    • Method Detail

      • getPaths

        List<GraphPath<V,​E>> getPaths​(V source,
                                            V sink)
        Get a shortest path from a source vertex to a sink vertex.
        Parameters:
        source - the source vertex
        sink - the target vertex
        Returns:
        a shortest path or null if no path exists