Class BellmanFordGraphSearch<V extends Vertex,​E extends Edge<V>>

  • All Implemented Interfaces:
    GraphPathSearch<V,​E>

    public class BellmanFordGraphSearch<V extends Vertex,​E extends Edge<V>>
    extends AbstractGraphPathSearch<V,​E>
    Bellman-Ford graph search algorithm for locating shortest-paths in directed graphs that may contain negative cycles.