|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--net.walend.digraph.UEDigraphAlgebra
Algebra for UEDigraph Operations.
Constructor Summary | |
UEDigraphAlgebra()
|
Method Summary | |
static boolean |
containsUEDigraph(UEDigraph outer,
UEDigraph inner)
Returns true if inner is a subgraph of outer. |
static void |
intersectUEDigraphs(UEDigraph dg1,
UEDigraph dg2,
MutableUEDigraph intersection)
Returns a UEDigraph containing the intersection of dg1 and dg2. |
static boolean |
sameUEDigraphs(UEDigraph dg1,
UEDigraph dg2)
Returns true if digraph is the same as this, and all their contents have the same state. |
static void |
unionUEDigraphs(UEDigraph dg1,
UEDigraph dg2,
MutableUEDigraph union)
Returns a UEDigraph containing the intersection of dg1 and dg2. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public UEDigraphAlgebra()
Method Detail |
public static boolean containsUEDigraph(UEDigraph outer, UEDigraph inner)
public static boolean sameUEDigraphs(UEDigraph dg1, UEDigraph dg2)
public static void intersectUEDigraphs(UEDigraph dg1, UEDigraph dg2, MutableUEDigraph intersection)
intersection
- should be an empty mutable digraph. If it isn't, this method clears it.public static void unionUEDigraphs(UEDigraph dg1, UEDigraph dg2, MutableUEDigraph union)
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |