Interface Graph<V,​E extends Edge<V>,​EX extends Exception>

  • All Superinterfaces:
    MultiGraph<V,​E,​EX>
    All Known Subinterfaces:
    SymmetricGraph<V,​E,​EX>
    All Known Implementing Classes:
    TrivialGraph

    public interface Graph<V,​E extends Edge<V>,​EX extends Exception>
    extends MultiGraph<V,​E,​EX>
    A graph is a set of vertices that are connected by directed edges. There may only be one edge for each direction between any two vertices.
    Author:
    AO Industries, Inc.
    • Method Detail

      • getEdgesFrom

        Set<E> getEdgesFrom​(V from)
                     throws EX extends Exception
        Gets the edges from the provided vertex. The vertex must be part of this graph, and the results are undefined if it is not. A graph only allows unique combinations of from and to vertices.
        Specified by:
        getEdgesFrom in interface MultiGraph<V,​E extends Edge<V>,​EX extends Exception>
        Throws:
        EX extends Exception