|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectedu.uci.ics.jung.graph.GraphDecorator<V,E>
edu.uci.ics.jung.graph.ObservableGraph<V,E>
public class ObservableGraph<V,E>
A decorator class for graphs which generates events
| Field Summary |
|---|
| Fields inherited from class edu.uci.ics.jung.graph.GraphDecorator |
|---|
delegate |
| Constructor Summary | |
|---|---|
ObservableGraph(Graph<V,E> delegate)
Creates a new instance based on the provided delegate. |
|
| Method Summary | |
|---|---|
boolean |
addEdge(E edge,
Collection<? extends V> vertices)
Adds edge to this graph. |
boolean |
addEdge(E e,
V v1,
V v2)
Adds edge e to this graph such that it connects
vertex v1 to v2. |
boolean |
addEdge(E e,
V v1,
V v2,
EdgeType edgeType)
Adds edge e to this graph such that it connects
vertex v1 to v2. |
void |
addGraphEventListener(GraphEventListener<V,E> l)
Adds l as a listener to this graph. |
boolean |
addVertex(V vertex)
Adds vertex to this graph. |
protected void |
fireGraphEvent(GraphEvent<V,E> evt)
|
boolean |
removeEdge(E edge)
Removes edge from this graph. |
void |
removeGraphEventListener(GraphEventListener<V,E> l)
Removes l as a listener to this graph. |
boolean |
removeVertex(V vertex)
Removes vertex from this graph. |
| Methods inherited from class edu.uci.ics.jung.graph.GraphDecorator |
|---|
addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncidentCount, getIncidentEdges, getIncidentVertices, getInEdges, getNeighborCount, getNeighbors, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, getVertexCount, getVertices, inDegree, isDest, isIncident, isNeighbor, isPredecessor, isSource, isSuccessor, outDegree |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public ObservableGraph(Graph<V,E> delegate)
delegate.
| Method Detail |
|---|
public void addGraphEventListener(GraphEventListener<V,E> l)
l as a listener to this graph.
public void removeGraphEventListener(GraphEventListener<V,E> l)
l as a listener to this graph.
protected void fireGraphEvent(GraphEvent<V,E> evt)
public boolean addEdge(E edge,
Collection<? extends V> vertices)
Hypergraphedge to this graph.
Fails under the following circumstances:
edge is already an element of the graph
either edge or vertices is null
vertices has the wrong number of vertices for the graph type
vertices are already connected by another edge in this graph,
and this graph does not accept parallel edges
addEdge in interface Hypergraph<V,E>addEdge in class GraphDecorator<V,E>true if the add is successful, and false otherwiseHypergraph.addEdge(java.lang.Object, java.util.Collection)
public boolean addEdge(E e,
V v1,
V v2,
EdgeType edgeType)
Graphe to this graph such that it connects
vertex v1 to v2.
Equivalent to addEdge(e, new Pair(v1, v2)) .
If this graph does not contain v1, v2,
or both, implementations may choose to either silently add
the vertices to the graph or throw an IllegalArgumentException.
If edgeType is not legal for this graph, this method will
throw IllegalArgumentException.
See Hypergraph.addEdge() for a listing of possible reasons
for failure.
addEdge in interface Graph<V,E>addEdge in class GraphDecorator<V,E>e - the edge to be addedv1 - the first vertex to be connectedv2 - the second vertex to be connectededgeType - the type to be assigned to the edge
true if the add is successful, false otherwiseGraph.addEdge(java.lang.Object, java.lang.Object, java.lang.Object, edu.uci.ics.jung.graph.util.EdgeType)
public boolean addEdge(E e,
V v1,
V v2)
Graphe to this graph such that it connects
vertex v1 to v2.
Equivalent to addEdge(e, new Pair(v1, v2)) .
If this graph does not contain v1, v2,
or both, implementations may choose to either silently add
the vertices to the graph or throw an IllegalArgumentException.
If this graph assigns edge types to its edges, the edge type of
e will be the default for this graph.
See Hypergraph.addEdge() for a listing of possible reasons
for failure.
addEdge in interface Graph<V,E>addEdge in class GraphDecorator<V,E>e - the edge to be addedv1 - the first vertex to be connectedv2 - the second vertex to be connected
true if the add is successful, false otherwiseGraph.addEdge(java.lang.Object, java.lang.Object, java.lang.Object)public 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 GraphDecorator<V,E>vertex - the vertex to add
true if the add is successful, and false otherwiseHypergraph.addVertex(java.lang.Object)public boolean removeEdge(E edge)
Hypergraphedge from this graph.
Fails if edge is null, or is otherwise not an element of this graph.
removeEdge in interface Hypergraph<V,E>removeEdge in class GraphDecorator<V,E>edge - the edge to remove
true if the removal is successful, false otherwiseHypergraph.removeEdge(java.lang.Object)public boolean removeVertex(V vertex)
Hypergraphvertex from this graph.
As a side effect, removes any edges e incident to vertex if the
removal of vertex would cause e to be incident to an illegal
number of vertices. (Thus, for example, incident hyperedges are not removed, but
incident edges--which must be connected to a vertex at both endpoints--are removed.)
Fails under the following circumstances:
vertex is not an element of this graph
vertex is null
removeVertex in interface Hypergraph<V,E>removeVertex in class GraphDecorator<V,E>vertex - the vertex to remove
true if the removal is successful, false otherwiseHypergraph.removeVertex(java.lang.Object)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||