|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectsoftparsmap.Split
For a tree T=(V,E), let d=(L1,L2) be a split iff L1, L2 [subset_of] L(T), |L1 [cut] L2|=0, L1 [union] L2 = L(T), and there exists an edge e [in] E so if removed we get two tree graphs T1 and T2 where L1 [subset_of] L(T1) and L2 [subset_of].
Constructor Summary | |
Split(Node node)
Constructing a split that exists between the node and its parent. |
|
Split(java.util.Set l1,
java.util.Set l2)
Constructor for two sets l1 and l2 defined above. |
Method Summary | |
java.util.Set |
getL1()
Returns the first part of this split. |
java.util.Set |
getL2()
Returns the second part of this split. |
boolean |
isConsistentWith(Split d)
Returns true if this split is consistent with the given split. |
java.lang.String |
toStringAll()
|
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public Split(Node node)
node
- is a node.public Split(java.util.Set l1, java.util.Set l2)
l1
- is defined abovel2
- is defined aboveMethod Detail |
public java.util.Set getL1()
public java.util.Set getL2()
public boolean isConsistentWith(Split d)
d
- is the split tested against this split
public java.lang.String toStringAll()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |