|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
A specific type of ArchetypeGraph
which consists of
a Vertex
set and an Edge
set.
Instances of Graph
may contain either directed or undirected
edges, but not both.
Edge
,
Vertex
Nested Class Summary |
Nested classes inherited from class edu.uci.ics.jung.utils.UserDataContainer |
UserDataContainer.CopyAction |
Field Summary | |
static Predicate |
DIRECTED_EDGE
|
static Predicate |
NOT_PARALLEL_EDGE
|
static Predicate |
SIMPLE_EDGE
|
static Predicate |
UNDIRECTED_EDGE
|
Fields inherited from interface edu.uci.ics.jung.graph.ArchetypeGraph |
SUBSET_MANAGER |
Method Summary | |
Edge |
addEdge(Edge e)
Adds e to this graph, and returns a reference to the
added vertex. |
Vertex |
addVertex(Vertex v)
Adds v to this graph, and returns a reference to the
added vertex. |
boolean |
isDirected()
Deprecated. As of version 1.4, replaced by edu.uci.ics.jung.graph.utils.PredicateUtils#enforcesDirected(Graph)
and edu.uci.ics.jung.graph.utils.PredicateUtils#enforcesUndirected(Graph) . |
void |
removeEdge(Edge e)
Removes e from this graph. |
void |
removeVertex(Vertex v)
Removes v from this graph. |
Methods inherited from interface edu.uci.ics.jung.graph.ArchetypeGraph |
addListener, copy, getEdgeConstraints, getEdges, getVertexConstraints, getVertices, newInstance, numEdges, numVertices, removeAllEdges, removeAllVertices, removeEdges, removeListener, removeVertices |
Methods inherited from interface edu.uci.ics.jung.utils.UserDataContainer |
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum |
Field Detail |
public static final Predicate DIRECTED_EDGE
public static final Predicate UNDIRECTED_EDGE
public static final Predicate NOT_PARALLEL_EDGE
public static final Predicate SIMPLE_EDGE
Method Detail |
public boolean isDirected()
edu.uci.ics.jung.graph.utils.PredicateUtils#enforcesDirected(Graph)
and edu.uci.ics.jung.graph.utils.PredicateUtils#enforcesUndirected(Graph)
.
true
if each edge of this graph is directed,
and false
if each edge of this graph is undirected.
If some edges are directed and some are not, throws
FatalException
.
public Vertex addVertex(Vertex v)
v
to this graph, and returns a reference to the
added vertex.
v
- the vertex to be addedpublic Edge addEdge(Edge e)
e
to this graph, and returns a reference to the
added vertex.
e
- the edge to be addedpublic void removeVertex(Vertex v)
v
from this graph. Any edges incident to
v
which become ill-formed (as defined in the documentation
for ArchetypeEdge
)
as a result of removing v
are also removed from this graph. Throws
IllegalArgumentException
if v
is not
in this graph.
public void removeEdge(Edge e)
e
from this graph. Throws
IllegalArgumentException
if e
is not
in this graph.
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |