net.walend.digraph
Class UEDigraphAlgebra

java.lang.Object
  |
  +--net.walend.digraph.UEDigraphAlgebra

public class UEDigraphAlgebra
extends java.lang.Object

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

UEDigraphAlgebra

public UEDigraphAlgebra()
Method Detail

containsUEDigraph

public static boolean containsUEDigraph(UEDigraph outer,
                                        UEDigraph inner)
Returns true if inner is a subgraph of outer.


sameUEDigraphs

public static boolean sameUEDigraphs(UEDigraph dg1,
                                     UEDigraph dg2)
Returns true if digraph is the same as this, and all their contents have the same state.


intersectUEDigraphs

public static void intersectUEDigraphs(UEDigraph dg1,
                                       UEDigraph dg2,
                                       MutableUEDigraph intersection)
Returns a UEDigraph containing the intersection of dg1 and dg2.

Parameters:
intersection - should be an empty mutable digraph. If it isn't, this method clears it.

unionUEDigraphs

public static void unionUEDigraphs(UEDigraph dg1,
                                   UEDigraph dg2,
                                   MutableUEDigraph union)
Returns a UEDigraph containing the intersection of dg1 and dg2. Edges in dg1 should win out.



Copyright (c) 2000, 2001, David Walend