public class DirectedOrderedSparseMultigraph<V,E> extends DirectedSparseMultigraph<V,E> implements edu.uci.ics.jung.graph.DirectedGraph<V,E>, edu.uci.ics.jung.graph.MultiGraph<V,E>
DirectedGraph
, suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time.edges, vertices
edge_type
Constructor and Description |
---|
DirectedOrderedSparseMultigraph()
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.DirectedGraph<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, getDest, getEdgeCount, getEdges, getEndpoints, getIncoming_internal, getInEdges, getOutEdges, getOutgoing_internal, getSource, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex
getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeType
addEdge, addEdge, addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getSource, getSuccessorCount, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree
addEdge, addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex
public DirectedOrderedSparseMultigraph()
public static <V,E> org.apache.commons.collections4.Factory<edu.uci.ics.jung.graph.DirectedGraph<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 DirectedSparseMultigraph<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 DirectedSparseMultigraph<V,E>
public java.util.Collection<V> getNeighbors(V vertex)
getNeighbors
in interface edu.uci.ics.jung.graph.Hypergraph<V,E>
getNeighbors
in class DirectedSparseMultigraph<V,E>
public java.util.Collection<E> getIncidentEdges(V vertex)
getIncidentEdges
in interface edu.uci.ics.jung.graph.Hypergraph<V,E>
getIncidentEdges
in class DirectedSparseMultigraph<V,E>