net.walend.digraph
Class GEDigraphAlgebra

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

public class GEDigraphAlgebra

extends java.lang.Object

Algebra for GEDigraph Operations.

Since:

20010812

Author:

David Walend

Constructor Summary

GEDigraphAlgebra()

Method Summary

static boolean	containsGEDigraph(GEDigraph outer, GEDigraph inner) Returns true if inner is a subgraph of outer.
static void	intersectGEDigraphs(GEDigraph dg1, GEDigraph dg2, MutableGEDigraph intersection) Returns a GEDigraph containing the intersection of dg1 and dg2.
static boolean	sameGEDigraphs(GEDigraph dg1, GEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static void	unionGEDigraphs(GEDigraph dg1, GEDigraph dg2, MutableGEDigraph union) Returns a GEDigraph 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

GEDigraphAlgebra

public GEDigraphAlgebra()

Method Detail

containsGEDigraph

public static boolean containsGEDigraph(GEDigraph outer,
                                        GEDigraph inner)

Returns true if inner is a subgraph of outer.

sameGEDigraphs

public static boolean sameGEDigraphs(GEDigraph dg1,
                                     GEDigraph dg2)

Returns true if digraph is the same as this, and all their contents have the same state.

intersectGEDigraphs

public static void intersectGEDigraphs(GEDigraph dg1,
                                       GEDigraph dg2,
                                       MutableGEDigraph intersection)

Returns a GEDigraph containing the intersection of dg1 and dg2.

Parameters:

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

unionGEDigraphs

public static void unionGEDigraphs(GEDigraph dg1,
                                   GEDigraph dg2,
                                   MutableGEDigraph union)

Returns a GEDigraph containing the intersection of dg1 and dg2. Edges in dg1 should win out.