net.walend.digraph.path.test
Class TestCEPathFactory

java.lang.Object
  |
  +--net.walend.digraph.test.TestCEDigraphFactory
        |
        +--net.walend.digraph.path.test.TestCEPathFactory

public class TestCEPathFactory

extends TestCEDigraphFactory

A factory for test digraphs.

Since:

20010922

Author:

David Walend dfw1@cornell.edu

Field Summary

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

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

Constructor Summary

TestCEPathFactory()

Method Summary

static void	fillCyclicTestPath(MutableCEPath path) Fills in the path with net.walend.digraph.path.ListCEPath {(A)-ab-(B)-bc-(C)-cd-(D)-de-(E)-eb-(B)-bc-(C)-cd-(D)-de-(E)-ef-(F)} through digraph net.walend.digraph.HashCEDigraph 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(MutableCEPath path) Fills in the path with net.walend.digraph.path.ListCEPath {(A)-ab-(B)-bc-(C)-cd-(D)} through digraph net.walend.digraph.HashCEDigraph 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.ListCEPath {(A)} through digraph net.walend.digraph.HashCEDigraph 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.TestCEDigraphFactory

fillTestCEDigraph

Methods inherited from class java.lang.Object

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

Constructor Detail

TestCEPathFactory

public TestCEPathFactory()

Method Detail

getStartNode

public static java.lang.Object getStartNode()

Use this to create net.walend.digraph.path.ListCEPath {(A)} through digraph net.walend.digraph.HashCEDigraph 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(MutableCEPath path)
                         throws EdgeMissingException,
                                NodeMissingException

Fills in the path with net.walend.digraph.path.ListCEPath {(A)-ab-(B)-bc-(C)-cd-(D)} through digraph net.walend.digraph.HashCEDigraph 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(MutableCEPath path)
                               throws EdgeMissingException,
                                      NodeMissingException

Fills in the path with net.walend.digraph.path.ListCEPath {(A)-ab-(B)-bc-(C)-cd-(D)-de-(E)-eb-(B)-bc-(C)-cd-(D)-de-(E)-ef-(F)} through digraph net.walend.digraph.HashCEDigraph 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