Class UndirectedOrderedSparseMultigraph<V,​E>

  • All Implemented Interfaces:
    edu.uci.ics.jung.graph.Graph<V,​E>, edu.uci.ics.jung.graph.Hypergraph<V,​E>, edu.uci.ics.jung.graph.MultiGraph<V,​E>, edu.uci.ics.jung.graph.UndirectedGraph<V,​E>, java.io.Serializable

    public class UndirectedOrderedSparseMultigraph<V,​E>
    extends UndirectedSparseMultigraph<V,​E>
    implements edu.uci.ics.jung.graph.UndirectedGraph<V,​E>
    An implementation of UndirectedGraph that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.
    See Also:
    Serialized Form
    • Constructor Detail

      • UndirectedOrderedSparseMultigraph

        public UndirectedOrderedSparseMultigraph()
        Creates a new instance.
    • Method Detail

      • getFactory

        public static <V,​E> org.apache.commons.collections4.Factory<edu.uci.ics.jung.graph.UndirectedGraph<V,​E>> getFactory()
        Returns a Factory that creates an instance of this graph type.
        Type Parameters:
        V - the vertex type for the graph factory
        E - the edge type for the graph factory
      • addVertex

        public boolean addVertex​(V vertex)
        Specified by:
        addVertex in interface edu.uci.ics.jung.graph.Hypergraph<V,​E>
        Overrides:
        addVertex in class UndirectedSparseMultigraph<V,​E>
      • getNeighbors

        public java.util.Collection<V> getNeighbors​(V vertex)
        Specified by:
        getNeighbors in interface edu.uci.ics.jung.graph.Hypergraph<V,​E>
        Overrides:
        getNeighbors in class UndirectedSparseMultigraph<V,​E>