Package dev.nm.graph

Interface UnDiGraph<V,​E extends UndirectedEdge<V>>

  • Type Parameters:
    V - vertex type
    E - undirected edge type
    All Superinterfaces:
    Graph<V,​E>
    All Known Implementing Classes:
    SparseUnDiGraph

    public interface UnDiGraph<V,​E extends UndirectedEdge<V>>
    extends Graph<V,​E>
    An undirected graph is a graph, or set of nodes connected by edges, where an edge does not differentiate between (a, b) or (b, a).
    See Also:
    Wikipedia: Undirected graph