|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectedu.uci.ics.jung.graph.AbstractGraph<V,E>
edu.uci.ics.jung.graph.AbstractTypedGraph<V,E>
edu.uci.ics.jung.graph.DirectedSparseMultigraph<V,E>
edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph<V,E>
public class DirectedOrderedSparseMultigraph<V,E>
An implementation of DirectedGraph, suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time.
| Field Summary |
|---|
| Fields inherited from class edu.uci.ics.jung.graph.DirectedSparseMultigraph |
|---|
edges, vertices |
| Fields inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph |
|---|
edge_type |
| Constructor Summary | |
|---|---|
DirectedOrderedSparseMultigraph()
Creates a new instance. |
|
| Method Summary | ||
|---|---|---|
boolean |
addVertex(V vertex)
Adds vertex to this graph. |
|
static
|
getFactory()
Returns a Factory that creates an instance of this graph type. |
|
Collection<E> |
getIncidentEdges(V vertex)
Returns the collection of edges in this graph which are connected to vertex. |
|
Collection<V> |
getNeighbors(V vertex)
Returns the collection of vertices which are connected to vertex
via any edges in this graph. |
|
Collection<V> |
getPredecessors(V vertex)
Returns a Collection view of the predecessors of vertex
in this graph. |
|
Collection<V> |
getSuccessors(V vertex)
Returns a Collection view of the successors of vertex
in this graph. |
|
| Methods inherited from class edu.uci.ics.jung.graph.DirectedSparseMultigraph |
|---|
addEdge, containsEdge, containsVertex, findEdge, getDest, getEdgeCount, getEdges, getEndpoints, getIncoming_internal, getInEdges, getOutEdges, getOutgoing_internal, getSource, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex |
| Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph |
|---|
getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeType |
| Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph |
|---|
addEdge, addEdge, addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface edu.uci.ics.jung.graph.Graph |
|---|
addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getSource, getSuccessorCount, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree |
| Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph |
|---|
addEdge, addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex |
| Constructor Detail |
|---|
public DirectedOrderedSparseMultigraph()
| Method Detail |
|---|
public static <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)
Hypergraphvertex to this graph.
Fails if vertex is null or already in the graph.
addVertex in interface Hypergraph<V,E>addVertex in class DirectedSparseMultigraph<V,E>vertex - the vertex to add
true if the add is successful, and false otherwisepublic Collection<V> getPredecessors(V vertex)
GraphCollection view of the predecessors of vertex
in this graph. A predecessor of vertex is defined as a vertex v
which is connected to
vertex by an edge e, where e is an outgoing edge of
v and an incoming edge of vertex.
getPredecessors in interface Graph<V,E>getPredecessors in interface Hypergraph<V,E>getPredecessors in class DirectedSparseMultigraph<V,E>vertex - the vertex whose predecessors are to be returned
Collection view of the predecessors of
vertex in this graphpublic Collection<V> getSuccessors(V vertex)
GraphCollection view of the successors of vertex
in this graph. A successor of vertex is defined as a vertex v
which is connected to
vertex by an edge e, where e is an incoming edge of
v and an outgoing edge of vertex.
getSuccessors in interface Graph<V,E>getSuccessors in interface Hypergraph<V,E>getSuccessors in class DirectedSparseMultigraph<V,E>vertex - the vertex whose predecessors are to be returned
Collection view of the successors of
vertex in this graphpublic Collection<V> getNeighbors(V vertex)
Hypergraphvertex
via any edges in this graph.
If vertex is connected to itself with a self-loop, then
it will be included in the collection returned.
getNeighbors in interface Hypergraph<V,E>getNeighbors in class DirectedSparseMultigraph<V,E>vertex - the vertex whose neighbors are to be returned
vertex,
or null if vertex is not presentpublic Collection<E> getIncidentEdges(V vertex)
Hypergraphvertex.
getIncidentEdges in interface Hypergraph<V,E>getIncidentEdges in class DirectedSparseMultigraph<V,E>vertex - the vertex whose incident edges are to be returned
vertex,
or null if vertex is not present
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||