|
|||||||||
| 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.SparseMultigraph<V,E>
net.sf.opendse.model.Graph<V,E>
V - the type of verticesE - the type of edgespublic class Graph<V extends Node,E extends Edge>
The Graph is the default graph implementation.
| Field Summary |
|---|
| Fields inherited from class edu.uci.ics.jung.graph.SparseMultigraph |
|---|
directedEdges, edges, vertices |
| Constructor Summary | |
|---|---|
Graph()
|
|
| Method Summary | |
|---|---|
E |
getEdge(E e)
Return the edge. |
E |
getEdge(java.lang.String id)
Return the edge with the specified id. |
V |
getVertex(java.lang.String id)
Return the vertex with the specified id. |
V |
getVertex(V v)
Return the vertex. |
java.util.Iterator<V> |
iterator()
|
boolean |
removeVertices(java.util.Collection<V> vertices)
Removes the vertices and returns true if at least one vertex was
removed. |
| Methods inherited from class edu.uci.ics.jung.graph.SparseMultigraph |
|---|
addEdge, addVertex, containsEdge, containsVertex, findEdge, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getFactory, getIncidentEdges, getIncoming_internal, getInEdges, getNeighbors, getOutEdges, getOutgoing_internal, getPredecessors, getSource, getSuccessors, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex |
| 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 |
| Constructor Detail |
|---|
public Graph()
| Method Detail |
|---|
public java.util.Iterator<V> iterator()
iterator in interface java.lang.Iterable<V extends Node>public V getVertex(V v)
v - the vertex
public E getEdge(E e)
e - the edge
public V getVertex(java.lang.String id)
id - the id
public E getEdge(java.lang.String id)
id - the id
public boolean removeVertices(java.util.Collection<V> vertices)
true if at least one vertex was
removed.
vertices - the vertices to remove
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||