net.walend.digraph.path.test
Class TestGEPathFactory

java.lang.Object
  |
  +--net.walend.digraph.test.TestGEDigraphFactory
        |
        +--net.walend.digraph.path.test.TestGEPathFactory

public class TestGEPathFactory

extends TestGEDigraphFactory

A factory for test digraphs.

Since:

20011023

Author:

David Walend dfw1@cornell.edu

Field Summary

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

GEDIGRAPH, nodeA, nodeB, nodeC, nodeD, nodeE, nodeF, nodeG, NODES, nodeY, nodeZ

Constructor Summary

TestGEPathFactory()

Method Summary

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

fillTestGEDigraph

Methods inherited from class java.lang.Object

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

Constructor Detail

TestGEPathFactory

public TestGEPathFactory()

Method Detail

getStartNode

public static java.lang.Object getStartNode()

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

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

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