net.walend.digraph.test
Class TestUEDigraphFactory

java.lang.Object
  |
  +--net.walend.digraph.test.TestUEDigraphFactory

public class TestUEDigraphFactory

extends java.lang.Object

A factory for test digraphs.

Since:

20010621

Author:

David Walend

Field Summary

static TestBean	edgeab
static TestBean	edgebc
static TestBean	edgecd
static TestBean	edgede
static TestBean	edgeeb
static TestBean	edgeef
static TestBean	edgegz
static Set	EDGES
static TestBean	edgeyz
static TestBean	nodeA
static TestBean	nodeB
static TestBean	nodeC
static TestBean	nodeD
static TestBean	nodeE
static TestBean	nodeF
static TestBean	nodeG
static Set	NODES
static TestBean	nodeY
static TestBean	nodeZ

Constructor Summary

TestUEDigraphFactory()

Method Summary

static void

fillTestUEDigraph(MutableUEDigraph digraph) Fills in the digraph with nodes {D,A,F,B,E,G,C} edges {(C,D,cd),(E,B,eb),(E,F,ef),(D,E,de),(B,C,bc),(A,B,ab)}.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

NODES

public static final Set NODES

EDGES

public static final Set EDGES

nodeA

public static final TestBean nodeA

nodeB

public static final TestBean nodeB

nodeC

public static final TestBean nodeC

nodeD

public static final TestBean nodeD

nodeE

public static final TestBean nodeE

nodeF

public static final TestBean nodeF

nodeG

public static final TestBean nodeG

edgeab

public static final TestBean edgeab

edgebc

public static final TestBean edgebc

edgecd

public static final TestBean edgecd

edgede

public static final TestBean edgede

edgeef

public static final TestBean edgeef

edgeeb

public static final TestBean edgeeb

nodeY

public static final TestBean nodeY

nodeZ

public static final TestBean nodeZ

edgegz

public static final TestBean edgegz

edgeyz

public static final TestBean edgeyz

Constructor Detail

TestUEDigraphFactory

public TestUEDigraphFactory()

Method Detail

fillTestUEDigraph

public static void fillTestUEDigraph(MutableUEDigraph digraph)

Fills in the digraph with nodes {D,A,F,B,E,G,C} edges {(C,D,cd),(E,B,eb),(E,F,ef),(D,E,de),(B,C,bc),(A,B,ab)}.