public class UndirectedOrderedSparseMultigraph<V,E> extends UndirectedSparseMultigraph<V,E> implements edu.uci.ics.jung.graph.UndirectedGraph<V,E>
UndirectedGraph that is suitable for sparse graphs,
orders its vertex and edge collections according to insertion time, and permits
parallel edges.edges, verticesedge_type| Constructor and Description |
|---|
UndirectedOrderedSparseMultigraph()
Creates a new instance.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
addVertex(V vertex) |
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. |
java.util.Collection<V> |
getNeighbors(V vertex) |
addEdge, addEdge, containsEdge, containsVertex, findEdge, getDest, getEdgeCount, getEdges, getEndpoints, getIncident_internal, getIncidentEdges, getInEdges, getOutEdges, getPredecessors, getSource, getSuccessors, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertexgetDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeTypeaddEdge, addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitaddEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegreeaddEdge, addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertexpublic UndirectedOrderedSparseMultigraph()
public static <V,E> org.apache.commons.collections4.Factory<edu.uci.ics.jung.graph.UndirectedGraph<V,E>> getFactory()
Factory that creates an instance of this graph type.V - the vertex type for the graph factoryE - the edge type for the graph factorypublic boolean addVertex(V vertex)
public java.util.Collection<V> getNeighbors(V vertex)
getNeighbors in interface edu.uci.ics.jung.graph.Hypergraph<V,E>getNeighbors in class UndirectedSparseMultigraph<V,E>