public class ParallelEdgePredicate extends EdgePredicate
A predicate that checks to see whether the specified edge is parallel to any other edge. A negation of this predicate may be used as an edge constraint that will prevent the constrained graph from accepting parallel edges. This predicate is probably not appropriate for use as a subset specification.
Two distinct edges are considered to be parallel to one another if the following conditions hold:
isInitializationPredicate| Modifier | Constructor and Description |
|---|---|
protected |
ParallelEdgePredicate() |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
evaluateDirectedEdge(DirectedEdge de,
java.util.Iterator s_iter) |
boolean |
evaluateEdge(ArchetypeEdge ae)
Returns
true if there exists an
edge which is parallel to the specified edge. |
protected boolean |
evaluateUndirectedEdge(UndirectedEdge ue,
java.util.Iterator s_iter) |
static ParallelEdgePredicate |
getInstance() |
protected boolean |
isDirected(Edge e) |
java.lang.String |
toString() |
evaluatepublic static ParallelEdgePredicate getInstance()
public java.lang.String toString()
toString in class java.lang.Objectpublic boolean evaluateEdge(ArchetypeEdge ae)
Returns true if there exists an
edge which is parallel to the specified edge.
evaluateEdge in class EdgePredicateVertex.findEdgeSet(Vertex)protected boolean evaluateDirectedEdge(DirectedEdge de, java.util.Iterator s_iter)
protected boolean evaluateUndirectedEdge(UndirectedEdge ue, java.util.Iterator s_iter)
protected boolean isDirected(Edge e)