Interface GraphSearch<V>

  • Type Parameters:
    V - the vertex type parameter
    All Known Implementing Classes:
    BreadthFirstSearch, DepthFirstSearch, DijkstraShortestPath

    public interface GraphSearch<V>

    Searches for a path between a given starting point and given ending point.

    Author:
    David B. Bracewell
    • Method Detail

      • search

        List<Edge<V>> search​(V startingPoint,
                             V endingPoint)
        Searches for a path from the given starting point to the given ending point
        Parameters:
        startingPoint - the starting point
        endingPoint - the ending point
        Returns:
        the path as a list of edges (empty list if no path exists)