com.phoenixst.plexus.operations
public class Join extends AbstractGraph implements Serializable
Graph
which is the join of two other
Graphs
with disjoint node sets. This implementation
does not actually check that the node sets are disjoint, but will
definitely behave strangely if they are not. The new edges added
to the the union of the two graphs may be directed or undirected as
specified in the constructor. These new edges never contain
user-defined objects.
Since: 1.0
Version: $Revision: 1.59 $
Constructor Summary | |
---|---|
Join(Graph left, Graph right, boolean isDirected)
Creates a new Join graph.
|
Method Summary | |
---|---|
boolean | containsEdge(Graph.Edge edge)
This implementation traverses over the edges in this graph
incident on the tail of the specified edge ,
looking for it and returning true if found. |
boolean | containsNode(Object node)
Returns true if this Graph contains
node . |
int | degree(Object node)
Returns the degree of node , defined as the number
of edges incident on node , with self-loops
counted twice. |
protected Collection | edges() |
Graph | getLeftOperand() |
Graph | getRightOperand() |
protected Collection | nodes() |
boolean | removeEdge(Graph.Edge edge)
Throws an UnsupportedOperationException . |
boolean | removeNode(Object node)
Throws an UnsupportedOperationException . |
String | toString() |
protected Traverser | traverser(Object node) |
Join
graph.
Parameters: left the first (left) graph operand for the join
operation.
right the second (right) graph operand for the join
operation.
isDirected whether or not the new edges added as part
of the join operation are directed. If true
,
nodes from the first operand are the tails of the edges.
edge
,
looking for it and returning true
if found.true
if this Graph
contains
node
.node
, defined as the number
of edges incident on node
, with self-loops
counted twice.UnsupportedOperationException
.UnsupportedOperationException
.