public class OrderedSparseMultigraph<V,E> extends SparseMultigraph<V,E> implements edu.uci.ics.jung.graph.MultiGraph<V,E>
Graph
that orders its vertex and edge collections
according to insertion time, is suitable for sparse graphs, and
permits directed, undirected, and parallel edges.directedEdges, edges, vertices
Constructor and Description |
---|
OrderedSparseMultigraph()
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.Graph<V,E>> |
getFactory()
Returns a
Factory that creates an instance of this graph type. |
java.util.Collection<E> |
getIncidentEdges(V vertex) |
java.util.Collection<V> |
getNeighbors(V vertex) |
java.util.Collection<V> |
getPredecessors(V vertex) |
java.util.Collection<V> |
getSuccessors(V vertex) |
addEdge, containsEdge, containsVertex, findEdge, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncoming_internal, getInEdges, getOutEdges, getOutgoing_internal, getSource, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex
addEdge, addEdge, addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString
public static <V,E> org.apache.commons.collections4.Factory<edu.uci.ics.jung.graph.Graph<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> getPredecessors(V vertex)
getPredecessors
in interface edu.uci.ics.jung.graph.Graph<V,E>
getPredecessors
in interface edu.uci.ics.jung.graph.Hypergraph<V,E>
getPredecessors
in class SparseMultigraph<V,E>
public java.util.Collection<V> getSuccessors(V vertex)
getSuccessors
in interface edu.uci.ics.jung.graph.Graph<V,E>
getSuccessors
in interface edu.uci.ics.jung.graph.Hypergraph<V,E>
getSuccessors
in class SparseMultigraph<V,E>
public java.util.Collection<V> getNeighbors(V vertex)
getNeighbors
in interface edu.uci.ics.jung.graph.Hypergraph<V,E>
getNeighbors
in class SparseMultigraph<V,E>
public java.util.Collection<E> getIncidentEdges(V vertex)
getIncidentEdges
in interface edu.uci.ics.jung.graph.Hypergraph<V,E>
getIncidentEdges
in class SparseMultigraph<V,E>