Uses of Interface
net.walend.digraph.CEDigraph

Packages that use CEDigraph

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

Uses of CEDigraph in net.walend.digraph

Subinterfaces of CEDigraph in net.walend.digraph

interface	IndexedCEDigraph CEDigraph methods that use indices.
interface	IndexedMutableCEDigraph Indexed mutators
interface	MutableCEDigraph MutableCEDigraph adds mutators to the CEDigraph interface so that a developer can add and remove edges and nodes.

Classes in net.walend.digraph that implement CEDigraph

class	AbstractHashCEDigraph This abstract class implements the CEDigraph interface using a Map and a Set.
class	AbstractLMCEDigraph An extension of AbstractMatrixCEDigraph that keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	AbstractMatrixCEDigraph This abstract class implements the CEDigraph interface using a Map and a Set.
class	HashCEDigraph This class implements the CEDigraph interface using a Map and a Set.
class	LMCEDigraph This class implements the CEDigraph interface using a Matrix and an array to speed up some indexed operations.
class	MatrixCEDigraph This class implements the CEDigraph interface using a Matrix.
class	MutableHashCEDigraph
class	MutableLMCEDigraph
class	MutableMatrixCEDigraph

Fields in net.walend.digraph declared as CEDigraph

static CEDigraph

CEDigraph.EMPTY

Methods in net.walend.digraph that return CEDigraph

CEDigraph	AbstractMatrixCEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractMatrixCEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
CEDigraph	AbstractHashCEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractHashCEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
CEDigraph	CEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	CEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.

Methods in net.walend.digraph with parameters of type CEDigraph

Bag	MutableCEDigraph.removeCEDigraph(CEDigraph digraph) Return a Bag of edges orphaned when digraph is removed
boolean	AbstractMatrixCEDigraph.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	AbstractMatrixCEDigraph.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
CEDigraph	AbstractMatrixCEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractMatrixCEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
private Bag	AbstractMatrixCEDigraph.removeEdges(CEDigraph digraph)
protected Bag	AbstractMatrixCEDigraph.removeCEDigraph(CEDigraph digraph)
Bag	MutableLMCEDigraph.removeCEDigraph(CEDigraph digraph)
boolean	AbstractHashCEDigraph.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	AbstractHashCEDigraph.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
CEDigraph	AbstractHashCEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractHashCEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
private Bag	AbstractHashCEDigraph.removeEdges(CEDigraph digraph)
protected Bag	AbstractHashCEDigraph.removeCEDigraph(CEDigraph digraph)
boolean	CEDigraph.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	CEDigraph.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsCEDigraph(digraph) and digraph.containsCEDigraph(this).
CEDigraph	CEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	CEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
static boolean	CEDigraphAlgebra.containsCEDigraph(CEDigraph outer, CEDigraph inner) Returns true if inner is a subgraph of outer.
static boolean	CEDigraphAlgebra.containsCEDigraph(CEDigraph outer, CEDigraph inner) Returns true if inner is a subgraph of outer.
static boolean	CEDigraphAlgebra.sameCEDigraphs(CEDigraph dg1, CEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static boolean	CEDigraphAlgebra.sameCEDigraphs(CEDigraph dg1, CEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static void	CEDigraphAlgebra.intersectCEDigraphs(CEDigraph dg1, CEDigraph dg2, MutableCEDigraph intersection) Returns a CEDigraph containing the intersection of dg1 and dg2.
static void	CEDigraphAlgebra.intersectCEDigraphs(CEDigraph dg1, CEDigraph dg2, MutableCEDigraph intersection) Returns a CEDigraph containing the intersection of dg1 and dg2.
static void	CEDigraphAlgebra.unionCEDigraphs(CEDigraph dg1, CEDigraph dg2, MutableCEDigraph union) Returns a CEDigraph containing the intersection of dg1 and dg2.
static void	CEDigraphAlgebra.unionCEDigraphs(CEDigraph dg1, CEDigraph dg2, MutableCEDigraph union) Returns a CEDigraph containing the intersection of dg1 and dg2.
static java.lang.String	CEDigraphAlgebra.toString(CEDigraph digraph)
Bag	MutableMatrixCEDigraph.removeCEDigraph(CEDigraph digraph)
Bag	MutableHashCEDigraph.removeCEDigraph(CEDigraph digraph)

Constructors in net.walend.digraph with parameters of type CEDigraph

AbstractHashGEDigraph(CEDigraph digraph)

AbstractMatrixCEDigraph(CEDigraph digraph)

LMCEDigraph(CEDigraph digraph)

MutableLMCEDigraph(CEDigraph digraph)

AbstractLMCEDigraph(CEDigraph digraph)

HashGEDigraph(CEDigraph digraph)

AbstractHashCEDigraph(CEDigraph digraph)

MatrixGEDigraph(CEDigraph digraph)

MutableMatrixGEDigraph(CEDigraph digraph)

MutableHashGEDigraph(CEDigraph digraph)

HashCEDigraph(CEDigraph digraph)

AbstractMatrixGEDigraph(CEDigraph digraph)

LMGEDigraph(CEDigraph digraph)

MatrixCEDigraph(CEDigraph digraph)

MutableLMGEDigraph(CEDigraph digraph)

MutableMatrixCEDigraph(CEDigraph digraph)

MutableHashCEDigraph(CEDigraph digraph)

AbstractLMGEDigraph(CEDigraph digraph)

Uses of CEDigraph in net.walend.digraph.path

Subinterfaces of CEDigraph in net.walend.digraph.path

interface	CEPath CEPath is an interface for represtenting paths through CEDigraph.
interface	DigraphOfCEPaths DigraphOfCEPaths is a CEDigraph containing the nodes from a base digraph and edges that are paths through the base digraph between these nodes.
interface	DigraphOfGEPaths DigraphOfGEPaths is a CEDigraph containing the nodes from a base digraph and edges that are paths through the base digraph between these nodes.
interface	MutableCEPath MutableCEPath is an interface for represtenting mutable paths through CEDigraph.
interface	MutableDigraphOfCEPaths This class contains mutator methods for a DigraphOfCEPaths.
interface	MutableDigraphOfGEPaths This class contains mutator methods for a DigraphOfCEPaths.

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

class	AbstractDelegateDigraphOfCEPaths This class implements the DigraphOfCEPaths by delegating to an underlying IndexedMutableCEDigraph.
protected static class	AbstractDelegateDigraphOfCEPaths.DigraphCEPath
class	AbstractDelegateDigraphOfGEPaths This class implements the DigraphOfGEPaths by delegating to an underlying IndexedMutableCEDigraph.
class	AbstractListCEPath This abstract class implements the CEPath interface using a List of nodes and a List of Edges.
class	ListCEPath This class implements the CEPath interface using two lists.
class	MutableListCEPath This class implements the MutableCEPath interface using two lists.

Fields in net.walend.digraph.path declared as CEDigraph

private CEDigraph

AbstractListCEPath.digraph

Methods in net.walend.digraph.path that return CEDigraph

CEDigraph	AbstractDelegateDigraphOfCEPaths.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractDelegateDigraphOfCEPaths.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
CEDigraph	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.getSupergraph() Returns the base.
CEDigraph	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
CEDigraph	AbstractDelegateDigraphOfGEPaths.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractDelegateDigraphOfGEPaths.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
CEDigraph	AbstractListCEPath.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractListCEPath.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
CEDigraph	AbstractListCEPath.getSupergraph() Returns the supergraph.
CEDigraph	CEPath.getSupergraph() Returns the supergraph.

Methods in net.walend.digraph.path with parameters of type CEDigraph

boolean	AbstractDelegateDigraphOfCEPaths.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	AbstractDelegateDigraphOfCEPaths.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this that is, if this.containsCEDigraph(digraph) and digraph.containsCEDigraph(this).
CEDigraph	AbstractDelegateDigraphOfCEPaths.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractDelegateDigraphOfCEPaths.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
boolean	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
CEDigraph	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
boolean	AbstractDelegateDigraphOfGEPaths.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	AbstractDelegateDigraphOfGEPaths.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this that is, if this.containsCEDigraph(digraph) and digraph.containsCEDigraph(this).
CEDigraph	AbstractDelegateDigraphOfGEPaths.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractDelegateDigraphOfGEPaths.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
boolean	AbstractListCEPath.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	AbstractListCEPath.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
CEDigraph	AbstractListCEPath.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	AbstractListCEPath.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.
static void	CEPathAlgebra.checkValid(CEPath path, CEDigraph digraph) Check that the path is valid on digraph.

Constructors in net.walend.digraph.path with parameters of type CEDigraph

AbstractListCEPath(CEDigraph digraph, java.lang.Object node)
Creates a new path on digraph that has only node in it with DEFAULTCAPACITY of 7.

AbstractListCEPath(CEDigraph digraph, java.lang.Object node, int nodeCapacity)
Creates a new path on digraph that has only node in it, with a capacity nodeCapacity.

AbstractListCEPath(CEDigraph digraph, java.lang.Object node, java.util.List nodeList, java.util.List edgeList)
Creates a new path on digraph that has only node in it, using nodeList and edgeList.

AbstractListCEPath(CEDigraph digraph, java.util.List nodeList, java.util.List edgeList)
Creates a new path on digraph that has only node in it, using nodeList and edgeList.

ListCEPath(CEDigraph digraph, java.util.List nodeList, java.util.List edgeList)
Creates a new path on digraph that has only node in it, using nodeListn and edgeList.

MutableListCEPath(CEDigraph digraph, java.lang.Object node)
Creates a new path on digraph that has only node in it with DEFAULTCAPACITY of 7.

MutableListCEPath(CEDigraph digraph, java.lang.Object node, int nodeCapacity)
Creates a new path on digraph that has only node in it, with a capacity nodeCapacity.

MutableListCEPath(CEDigraph digraph, java.lang.Object node, java.util.List nodeList, java.util.List edgeList)
Creates a new path on digraph that has only node in it, using nodeListn and edgeList.

MutableListCEPath(CEDigraph digraph, java.util.List nodeList, java.util.List edgeList)
Creates a new path on digraph that has only node in it, using nodeListn and edgeList.

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

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

protected CEDigraph	MutableListCEPathTest.getEmptyTestCEDigraph()
protected CEDigraph	MutableListCEPathTest.getTestCEDigraph()
protected CEDigraph	ListCEPathTest.getEmptyTestCEDigraph()
protected CEDigraph	ListCEPathTest.getTestCEDigraph()

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

void	CEPathTest.testGetSupergraph(CEPath path, CEDigraph expected)

Uses of CEDigraph in net.walend.digraph.test

Fields in net.walend.digraph.test declared as CEDigraph

static CEDigraph

TestCEDigraphFactory.CEDIGRAPH

Methods in net.walend.digraph.test that return CEDigraph

protected CEDigraph	MutableMatrixCEDigraphTest.getEmptyTestCEDigraph()
protected CEDigraph	MutableMatrixCEDigraphTest.getTestCEDigraph()
protected CEDigraph	MatrixCEDigraphTest.getEmptyTestCEDigraph()
protected CEDigraph	MatrixCEDigraphTest.getTestCEDigraph()
protected CEDigraph	LMCEDigraphTest.getEmptyTestCEDigraph()
protected CEDigraph	LMCEDigraphTest.getTestCEDigraph()
protected CEDigraph	MutableHashCEDigraphTest.getEmptyTestCEDigraph()
protected CEDigraph	MutableHashCEDigraphTest.getTestCEDigraph()
protected CEDigraph	HashCEDigraphTest.getEmptyTestCEDigraph()
protected CEDigraph	HashCEDigraphTest.getTestCEDigraph()
protected CEDigraph	MutableLMCEDigraphTest.getEmptyTestCEDigraph()
protected CEDigraph	MutableLMCEDigraphTest.getTestCEDigraph()
protected abstract CEDigraph	CEDigraphTest.getEmptyTestCEDigraph()
protected abstract CEDigraph	CEDigraphTest.getTestCEDigraph()

Methods in net.walend.digraph.test with parameters of type CEDigraph

protected void	CEDigraphTest.testToString(CEDigraph digraph)
protected void	CEDigraphTest.testNodeCount(CEDigraph digraph, int expected)
protected void	CEDigraphTest.testEdgeCount(CEDigraph digraph, int expected)
protected void	CEDigraphTest.testIsEmpty(CEDigraph digraph, boolean expected)
protected void	CEDigraphTest.testIsEdgeFree(CEDigraph digraph, boolean expected)
protected void	CEDigraphTest.testContainsNode(CEDigraph digraph, java.lang.Object node, boolean expected)
protected void	CEDigraphTest.testContainsEdge(CEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, boolean expected, boolean expectException)
protected void	CEDigraphTest.testContainsEdge(CEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge, boolean expected, boolean expectException)
protected void	CEDigraphTest.testContainsEdgeAllWays(CEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge, boolean expected, boolean expectException)
protected void	CEDigraphTest.testCountInboundEdges(CEDigraph digraph, java.lang.Object node, int expected, boolean expectException)
protected void	CEDigraphTest.testCountOutboundEdges(CEDigraph digraph, java.lang.Object node, int expected, boolean expectException)
protected void	CEDigraphTest.testGetInboundEdges(CEDigraph digraph, java.lang.Object node, Bag expected, boolean expectException)
protected void	CEDigraphTest.testGetOutboundEdges(CEDigraph digraph, java.lang.Object node, Bag expected, boolean expectException)
protected void	CEDigraphTest.testGetEdge(CEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object expected, boolean expectException)
protected void	CEDigraphTest.testGetToNodes(CEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	CEDigraphTest.testGetFromNodes(CEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	CEDigraphTest.testNodeIterator(CEDigraph digraph, java.util.Set expected)
protected void	CEDigraphTest.testEdgeIterator(CEDigraph digraph)
protected void	CEDigraphTest.testGetNodes(CEDigraph digraph, java.util.Set expected)
protected void	CEDigraphTest.testGetEdges(CEDigraph digraph, Bag expected)
protected void	CEDigraphTest.testContainsNodes(CEDigraph digraph, java.util.Set nodes, boolean expected)
protected void	CEDigraphTest.testContainsCEDigraph(CEDigraph digraph, CEDigraph containedCEDigraph, boolean expected)
protected void	CEDigraphTest.testContainsCEDigraph(CEDigraph digraph, CEDigraph containedCEDigraph, boolean expected)
protected void	CEDigraphTest.testSameCEDigraphAs(CEDigraph digraph, CEDigraph containedCEDigraph, boolean expected)
protected void	CEDigraphTest.testSameCEDigraphAs(CEDigraph digraph, CEDigraph containedCEDigraph, boolean expected)

Uses of CEDigraph in net.walend.measured

Subinterfaces of CEDigraph in net.walend.measured

interface	MeasuredCEPath
interface	ShortestCEPaths This interface is a DigraphOfCEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter.
interface	ShortestGEPaths This interface is a DigraphOfGEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter.

Classes in net.walend.measured that implement CEDigraph

class	AbstractShortestCEPaths AbstractShortestCEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes.
private class	AbstractShortestCEPaths.DigraphMeasuredCEPath
class	AbstractShortestGEPaths AbstractShortestGEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes.
class	CEBellmanFordTest Performs the Bellman-Ford test for a given digraph and pathmeter.
private static class	CEBellmanFordTest.BFCEDigraph This is simply a wrapper of a CEDigraph that has a BFNode and BFEdges from that node to all nodes.
class	CEPathsFromShortestDistances CEPathsFromShortestDistances wraps a ShortestCEDistances object to provide a full ShortestCEPaths interface.
private class	CEPathsFromShortestDistances.DigraphMeasuredCEPath
class	DijkstraShortestCEPaths DijkstraShortestCEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table.
class	DijkstraShortestGEPaths DijkstraShortestGEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table.
class	FloydWarshallShortestCEPaths FloydWarshallShortestCEPaths uses the very simple Floyd-Warshall algorithm to find the shortest paths.
class	FloydWarshallShortestGEPaths FloydWarshallShortestGEPaths uses the very simple Floyd-Warshall algorithm to find the shortest paths.
class	GEBellmanFordTest Performs the Bellman-Ford test for a given digraph and pathmeter.
class	JITShortestCEPaths JITShortestCEPaths is an implementation of ShortestCEPaths that uses Dijkstra's algorithm to find the shortest paths just in time.
class	JITShortestGEPaths JITShortestGEPaths is an implementation of ShortestGEPaths that uses Dijkstra's algorithm to find the shortest paths just in time.
class	JohnsonShortestCEPaths JohnsonShortestCEPaths uses Johnson's algorithm to find the shortest paths during construction.
class	JohnsonShortestGEPaths JohnsonShortestGEPaths uses Johnson's algorithm to find the shortest paths during construction.

Methods in net.walend.measured that return CEDigraph

CEDigraph	CEBellmanFordTest.BFCEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	CEBellmanFordTest.BFCEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.

Methods in net.walend.measured with parameters of type CEDigraph

boolean	CEBellmanFordTest.BFCEDigraph.containsCEDigraph(CEDigraph digraph) Returns true if digraph is a subgraph of this CEDigraph.
boolean	CEBellmanFordTest.BFCEDigraph.sameCEDigraphAs(CEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsCEDigraph(digraph) and digraph.containsCEDigraph(this).
CEDigraph	CEBellmanFordTest.BFCEDigraph.intersectWithCEDigraph(CEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
CEDigraph	CEBellmanFordTest.BFCEDigraph.unionCEDigraph(CEDigraph digraph) Returns a new digraph that is the union of this with digraph.

Uses of CEDigraph in net.walend.measured.test

Methods in net.walend.measured.test that return CEDigraph

protected CEDigraph	ShortestCEPathTest.getEmptyTestCEDigraph()
protected CEDigraph	ShortestCEPathTest.getTestCEDigraph()