Hyperedge
.public class HyperedgeBPG extends AbstractHyperUnitBPG implements Hyperedge
SetHyperedge
,
ListHyperedge
UserDataContainer.CopyAction
graph, vertex
Constructor and Description |
---|
HyperedgeBPG()
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
boolean |
connectVertex(Hypervertex hv3_x)
Deprecated.
Registers an additional vertex
hv3_x onto this Edge. |
ArchetypeEdge |
copy(ArchetypeGraph g)
Deprecated.
Creates a copy of this edge in graph
g . |
boolean |
disconnectVertex(Hypervertex v)
Deprecated.
Disconnects
hv1 from this hyperedge and vice versa. |
ArchetypeEdge |
getEqualEdge(ArchetypeGraph g)
Deprecated.
Returns the edge in graph
g , if any,
that is equivalent to this edge. |
ArchetypeEdge |
getEquivalentEdge(ArchetypeGraph g)
Deprecated.
As of version 1.4, renamed to getEqualEdge(g).
|
java.util.Set |
getIncidentElements()
Deprecated.
Returns the set of elements that are incident to this element.
|
java.util.Set |
getIncidentVertices()
Deprecated.
Returns the set of vertices which are incident to this edge.
|
boolean |
isIncident(ArchetypeVertex v)
Deprecated.
Returns
true if the specified vertex v
is incident to this edge, and false otherwise. |
int |
numVertices()
Deprecated.
Returns the number of vertices which are incident to this edge.
|
addUserDatum, clone, containsUserDatumKey, equals, getGraph, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, removeVertex, setGraph, setUserDatum, underlying_vertex
finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum
public java.util.Set getIncidentElements()
Element
getIncidentElements
in interface Element
public java.util.Set getIncidentVertices()
ArchetypeEdge
ArchetypeVertex
.
For example, returns the source and destination vertices of a
directed edge.getIncidentVertices
in interface ArchetypeEdge
ArchetypeEdge.getIncidentVertices()
public ArchetypeEdge getEqualEdge(ArchetypeGraph g)
ArchetypeEdge
g
, if any,
that is equivalent to this edge.
Two edges are equivalent if one of them is an ancestor
(via copy()
) of the other.getEqualEdge
in interface ArchetypeEdge
ArchetypeEdge.getEqualEdge(edu.uci.ics.jung.graph.ArchetypeGraph)
public ArchetypeEdge getEquivalentEdge(ArchetypeGraph g)
getEquivalentEdge
in interface ArchetypeEdge
public int numVertices()
ArchetypeEdge
numVertices
in interface ArchetypeEdge
ArchetypeEdge.numVertices()
public boolean isIncident(ArchetypeVertex v)
ArchetypeEdge
true
if the specified vertex v
is incident to this edge, and false
otherwise.
The behavior of this method is undefined if v
is not
an element of this edge's graph.isIncident
in interface ArchetypeEdge
ArchetypeEdge.isIncident(edu.uci.ics.jung.graph.ArchetypeVertex)
public ArchetypeEdge copy(ArchetypeGraph g)
ArchetypeEdge
g
. The edge created
will be equivalent to this edge: given e = this.copy(g)
,
then this.getEquivalentEdge(g) == e
,
and this.equals(e) == true
.
Given the set
of vertices S that are incident to this edge, the copied edge will be
made incident to the set of vertices S' in g
that are
equivalent to S. S must be copied into g
before
this edge can be copied into g
. If there is no
such set of vertices in g
,
this method throws IllegalArgumentException
.
Thus, for example, given the following code:
Graph g1 = new Graph(); Vertex v1 = g1.addVertex(new DirectedSparseVertex()); Vertex v2 = g1.addVertex(new DirectedSparseVertex()); ... Edge e = g1.addEdge(new DirectedSparseEdge(v1, v2)); Vertex v3 = v1.getEquivalentVertex(g2); Vertex v4 = v2.getEquivalentVertex(g2);then
e.copy(g2)
will create a directed edge
connecting v3
to v4
in g2
.copy
in interface ArchetypeEdge
g
- the graph in which the copied edge will be placedArchetypeEdge.copy(edu.uci.ics.jung.graph.ArchetypeGraph)
public boolean connectVertex(Hypervertex hv3_x)
hv3_x
onto this Edge.connectVertex
in interface Hyperedge
public boolean disconnectVertex(Hypervertex v)
Hyperedge
hv1
from this hyperedge and vice versa.
Does not affect hv1
's membership in the graph.
Equivalent to calling hv1.disconnectEdge(this)
.disconnectVertex
in interface Hyperedge