net.walend.digraph.path.test
Class TestUEPathFactory

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

public class TestUEPathFactory

extends TestUEDigraphFactory

A factory for test digraphs.

Author:

David Walend dfw1@cornell.edu

Field Summary

Fields inherited from class net.walend.digraph.test.TestUEDigraphFactory

edgeab, edgebc, edgecd, edgede, edgeeb, edgeef, edgegz, EDGES, edgeyz, nodeA, nodeB, nodeC, nodeD, nodeE, nodeF, nodeG, NODES, nodeY, nodeZ, UEDIGRAPH

Constructor Summary

TestUEPathFactory()

Method Summary

static void	fillCyclicTestPath(MutableUEPath path) Fills in the path with net.walend.digraph.path.ListUEPath {(A)-ab-(B)-bc-(C)-cd-(D)-de-(E)-eb-(B)-bc-(C)-cd-(D)-de-(E)-ef-(F)} through digraph net.walend.digraph.HashUEDigraph nodes {G,C,A,B,D,E,F} edges {(B,C,bc),(F,C,ab),(D,E,de),(C,D,cd),(E,F,ef),(E,B,eb),(A,B,ab)}
static void	fillTestPath(MutableUEPath path) Fills in the path with net.walend.digraph.path.ListUEPath {(A)-ab-(B)-bc-(C)-cd-(D)} through digraph net.walend.digraph.HashUEDigraph nodes {G,C,A,B,D,E,F} edges {(B,C,bc),(F,C,ab),(D,E,de),(C,D,cd),(E,F,ef),(E,B,eb),(A,B,ab)}
static java.lang.Object	getStartNode() Use this to create net.walend.digraph.path.ListUEPath {(A)} through digraph net.walend.digraph.HashUEDigraph nodes {G,C,A,B,D,E,F} edges {(B,C,bc),(F,C,ab),(D,E,de),(C,D,cd),(E,F,ef),(E,B,eb),(A,B,ab)}

Methods inherited from class net.walend.digraph.test.TestUEDigraphFactory

fillTestUEDigraph

Methods inherited from class java.lang.Object

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

Constructor Detail

TestUEPathFactory

public TestUEPathFactory()

Method Detail

getStartNode

public static java.lang.Object getStartNode()

Use this to create net.walend.digraph.path.ListUEPath {(A)} through digraph net.walend.digraph.HashUEDigraph nodes {G,C,A,B,D,E,F} edges {(B,C,bc),(F,C,ab),(D,E,de),(C,D,cd),(E,F,ef),(E,B,eb),(A,B,ab)}

fillTestPath

public static void fillTestPath(MutableUEPath path)
                         throws EdgeMissingException,
                                NodeMissingException

Fills in the path with net.walend.digraph.path.ListUEPath {(A)-ab-(B)-bc-(C)-cd-(D)} through digraph net.walend.digraph.HashUEDigraph nodes {G,C,A,B,D,E,F} edges {(B,C,bc),(F,C,ab),(D,E,de),(C,D,cd),(E,F,ef),(E,B,eb),(A,B,ab)}

EdgeMissingException

NodeMissingException

fillCyclicTestPath

public static void fillCyclicTestPath(MutableUEPath path)
                               throws EdgeMissingException,
                                      NodeMissingException

Fills in the path with net.walend.digraph.path.ListUEPath {(A)-ab-(B)-bc-(C)-cd-(D)-de-(E)-eb-(B)-bc-(C)-cd-(D)-de-(E)-ef-(F)} through digraph net.walend.digraph.HashUEDigraph nodes {G,C,A,B,D,E,F} edges {(B,C,bc),(F,C,ab),(D,E,de),(C,D,cd),(E,F,ef),(E,B,eb),(A,B,ab)}

EdgeMissingException

NodeMissingException