Uses of Interface
net.walend.digraph.path.MutableUEPath

Packages that use MutableUEPath

net.walend.digraph.path	This package contains a kit for working with paths on directed graphs.
net.walend.digraph.path.test

Uses of MutableUEPath in net.walend.digraph.path

Classes in net.walend.digraph.path that implement MutableUEPath

class

MutableListUEPath This class implements the MutableUEPath interface using two lists.

Uses of MutableUEPath in net.walend.digraph.path.test

Methods in net.walend.digraph.path.test that return MutableUEPath

protected MutableUEPath	MutableListUEPathTest.getOneNodeMutableUEPath()
protected MutableUEPath	MutableListUEPathTest.getTestMutableUEPath()
protected MutableUEPath	MutableListUEPathTest.getTestMutableUEPathTail()
protected MutableUEPath	MutableListUEPathTest.getCyclicTestMutableUEPath()
protected abstract MutableUEPath	MutableUEPathTest.getTestMutableUEPathTail()
protected MutableUEPath	ListUEPathTest.getOneNodeMutableUEPath()
protected MutableUEPath	ListUEPathTest.getTestMutableUEPath()
protected MutableUEPath	ListUEPathTest.getCyclicTestMutableUEPath()
protected abstract MutableUEPath	UEPathTest.getOneNodeMutableUEPath()
protected abstract MutableUEPath	UEPathTest.getTestMutableUEPath()
protected abstract MutableUEPath	UEPathTest.getCyclicTestMutableUEPath()

Methods in net.walend.digraph.path.test with parameters of type MutableUEPath

static void	TestUEPathFactory.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 void	TestUEPathFactory.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)}