Uses of Interface
net.walend.digraph.UEDigraph

Packages that use UEDigraph

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

Uses of UEDigraph in net.walend.digraph

Subinterfaces of UEDigraph in net.walend.digraph

interface

MutableUEDigraph MutableUEDigraph adds mutators to the UEDigraph interface so that a developer can add and remove edges and nodes.

Classes in net.walend.digraph that implement UEDigraph

class	AbstractHashUEDigraph This abstract class implements the UEDigraph interface using three HashMaps.
class	AbstractMatrixUEDigraph This abstract class implements the UEDigraph interface using a List and a Grid.
class	HashUEDigraph This class implements the UEDigraph interface using three HashMaps.
class	MatrixUEDigraph This class implements the UEDigraph interface using a List and a Grid.
class	MutableHashUEDigraph
class	MutableMatrixUEDigraph

Fields in net.walend.digraph declared as UEDigraph

static UEDigraph

UEDigraph.EMPTY

Methods in net.walend.digraph that return UEDigraph

UEDigraph	AbstractMatrixUEDigraph.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	AbstractMatrixUEDigraph.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.
UEDigraph	AbstractHashUEDigraph.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	AbstractHashUEDigraph.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.
UEDigraph	UEDigraph.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	UEDigraph.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.

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

java.util.Set	MutableMatrixUEDigraph.removeUEDigraph(UEDigraph digraph)
java.util.Set	MutableUEDigraph.removeUEDigraph(UEDigraph digraph) Return a Set of edges orphaned when digraph is removed
static boolean	UEDigraphAlgebra.containsUEDigraph(UEDigraph outer, UEDigraph inner) Returns true if inner is a subgraph of outer.
static boolean	UEDigraphAlgebra.containsUEDigraph(UEDigraph outer, UEDigraph inner) Returns true if inner is a subgraph of outer.
static boolean	UEDigraphAlgebra.sameUEDigraphs(UEDigraph dg1, UEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static boolean	UEDigraphAlgebra.sameUEDigraphs(UEDigraph dg1, UEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static void	UEDigraphAlgebra.intersectUEDigraphs(UEDigraph dg1, UEDigraph dg2, MutableUEDigraph intersection) Returns a UEDigraph containing the intersection of dg1 and dg2.
static void	UEDigraphAlgebra.intersectUEDigraphs(UEDigraph dg1, UEDigraph dg2, MutableUEDigraph intersection) Returns a UEDigraph containing the intersection of dg1 and dg2.
static void	UEDigraphAlgebra.unionUEDigraphs(UEDigraph dg1, UEDigraph dg2, MutableUEDigraph union) Returns a UEDigraph containing the intersection of dg1 and dg2.
static void	UEDigraphAlgebra.unionUEDigraphs(UEDigraph dg1, UEDigraph dg2, MutableUEDigraph union) Returns a UEDigraph containing the intersection of dg1 and dg2.
static java.lang.String	UEDigraphAlgebra.multilineToString(UEDigraph digraph)
static java.lang.String	UEDigraphAlgebra.toString(UEDigraph digraph)
boolean	AbstractMatrixUEDigraph.containsUEDigraph(UEDigraph digraph) Returns true if digraph is a subgraph of this UEDigraph.
boolean	AbstractMatrixUEDigraph.sameUEDigraphAs(UEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
UEDigraph	AbstractMatrixUEDigraph.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	AbstractMatrixUEDigraph.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.
private java.util.Set	AbstractMatrixUEDigraph.removeEdges(UEDigraph digraph)
protected java.util.Set	AbstractMatrixUEDigraph.removeUEDigraph(UEDigraph digraph)
boolean	AbstractHashUEDigraph.containsUEDigraph(UEDigraph digraph) Returns true if digraph is a subgraph of this UEDigraph.
boolean	AbstractHashUEDigraph.sameUEDigraphAs(UEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
UEDigraph	AbstractHashUEDigraph.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	AbstractHashUEDigraph.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.
protected java.util.Set	AbstractHashUEDigraph.removeUEDigraph(UEDigraph digraph)
boolean	UEDigraph.containsUEDigraph(UEDigraph digraph) Returns true if digraph is a subgraph of this UEDigraph.
boolean	UEDigraph.sameUEDigraphAs(UEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsUEDigraph(digraph) and digraph.containsUEDigraph(this).
UEDigraph	UEDigraph.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	UEDigraph.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.
java.util.Set	MutableHashUEDigraph.removeUEDigraph(UEDigraph digraph)

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

MatrixUEDigraph(UEDigraph digraph)

MutableMatrixUEDigraph(UEDigraph digraph)

AbstractHashGEDigraph(UEDigraph digraph)

AbstractMatrixCEDigraph(UEDigraph digraph)

LMCEDigraph(UEDigraph digraph)

MutableLMCEDigraph(UEDigraph digraph)

AbstractLMCEDigraph(UEDigraph digraph)

AbstractMatrixUEDigraph(UEDigraph digraph)

HashGEDigraph(UEDigraph digraph)

AbstractHashCEDigraph(UEDigraph digraph)

AbstractHashUEDigraph(UEDigraph digraph)

MatrixGEDigraph(UEDigraph digraph)

MutableMatrixGEDigraph(UEDigraph digraph)

MutableHashGEDigraph(UEDigraph digraph)

HashCEDigraph(UEDigraph digraph)

AbstractMatrixGEDigraph(UEDigraph digraph)

LMGEDigraph(UEDigraph digraph)

MatrixCEDigraph(UEDigraph digraph)

MutableLMGEDigraph(UEDigraph digraph)

MutableMatrixCEDigraph(UEDigraph digraph)

HashUEDigraph(UEDigraph digraph)

MutableHashCEDigraph(UEDigraph digraph)

MutableHashUEDigraph(UEDigraph digraph)

AbstractLMGEDigraph(UEDigraph digraph)

Uses of UEDigraph in net.walend.digraph.path

Subinterfaces of UEDigraph in net.walend.digraph.path

interface	MutableUEPath MutableUEPath is an interface for represtenting mutable paths through UEDigraph.
interface	UEPath UEPath is an interface for represtenting paths through UEDigraph.

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

class	AbstractListUEPath This abstract class implements the UEPath interface using a List of nodes and a List of Edges.
class	ListUEPath This class implements the UEPath interface using two lists.
class	MutableListUEPath This class implements the MutableUEPath interface using two lists.

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

private UEDigraph

AbstractListUEPath.digraph

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

UEDigraph	UEPath.getSupergraph() Returns the supergraph.
UEDigraph	AbstractListUEPath.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	AbstractListUEPath.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.
UEDigraph	AbstractListUEPath.getSupergraph() Returns the supergraph.

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

static void	UEPathAlgebra.checkValid(UEPath path, UEDigraph digraph) Check that the path is valid on digraph.
boolean	AbstractListUEPath.containsUEDigraph(UEDigraph digraph) Returns true if digraph is a subgraph of this UEDigraph.
boolean	AbstractListUEPath.sameUEDigraphAs(UEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
UEDigraph	AbstractListUEPath.intersectWithUEDigraph(UEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
UEDigraph	AbstractListUEPath.unionUEDigraph(UEDigraph digraph) Returns a new digraph that is the union of this with digraph.

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

ListUEPath(UEDigraph 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.

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

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

MutableListUEPath(UEDigraph 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.

MutableListUEPath(UEDigraph 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.

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

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

AbstractListUEPath(UEDigraph 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.

AbstractListUEPath(UEDigraph 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.

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

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

protected UEDigraph	MutableListUEPathTest.getEmptyTestUEDigraph()
protected UEDigraph	MutableListUEPathTest.getTestUEDigraph()
protected UEDigraph	ListUEPathTest.getEmptyTestUEDigraph()
protected UEDigraph	ListUEPathTest.getTestUEDigraph()

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

void	UEPathTest.testGetSupergraph(UEPath path, UEDigraph expected)

Uses of UEDigraph in net.walend.digraph.test

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

static UEDigraph

TestUEDigraphFactory.UEDIGRAPH

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

protected abstract UEDigraph	UEDigraphTest.getEmptyTestUEDigraph()
protected abstract UEDigraph	UEDigraphTest.getTestUEDigraph()
protected UEDigraph	MutableMatrixUEDigraphTest.getEmptyTestUEDigraph()
protected UEDigraph	MutableMatrixUEDigraphTest.getTestUEDigraph()
protected UEDigraph	MatrixUEDigraphTest.getEmptyTestUEDigraph()
protected UEDigraph	MatrixUEDigraphTest.getTestUEDigraph()
protected UEDigraph	MutableHashUEDigraphTest.getEmptyTestUEDigraph()
protected UEDigraph	MutableHashUEDigraphTest.getTestUEDigraph()
protected UEDigraph	HashUEDigraphTest.getEmptyTestUEDigraph()
protected UEDigraph	HashUEDigraphTest.getTestUEDigraph()

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

protected void	UEDigraphTest.testToString(UEDigraph digraph)
protected void	UEDigraphTest.testNodeCount(UEDigraph digraph, int expected)
protected void	UEDigraphTest.testEdgeCount(UEDigraph digraph, int expected)
protected void	UEDigraphTest.testIsEmpty(UEDigraph digraph, boolean expected)
protected void	UEDigraphTest.testIsEdgeFree(UEDigraph digraph, boolean expected)
protected void	UEDigraphTest.testContainsNode(UEDigraph digraph, java.lang.Object node, boolean expected)
protected void	UEDigraphTest.testContainsEdge(UEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, boolean expected, boolean expectException)
protected void	UEDigraphTest.testContainsEdge(UEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge, boolean expected, boolean expectException)
protected void	UEDigraphTest.testContainsEdge(UEDigraph digraph, java.lang.Object edge, boolean expected)
protected void	UEDigraphTest.testContainsEdgeAllWays(UEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge, boolean expected, boolean expectException)
protected void	UEDigraphTest.testCountInboundEdges(UEDigraph digraph, java.lang.Object node, int expected, boolean expectException)
protected void	UEDigraphTest.testCountOutboundEdges(UEDigraph digraph, java.lang.Object node, int expected, boolean expectException)
protected void	UEDigraphTest.testGetInboundEdges(UEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	UEDigraphTest.testGetOutboundEdges(UEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	UEDigraphTest.testGetFromNode(UEDigraph digraph, java.lang.Object edge, java.lang.Object expected, boolean expectException)
protected void	UEDigraphTest.testGetToNode(UEDigraph digraph, java.lang.Object edge, java.lang.Object expected, boolean expectException)
protected void	UEDigraphTest.testGetEdge(UEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object expected, boolean expectException)
protected void	UEDigraphTest.testGetToNodes(UEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	UEDigraphTest.testGetFromNodes(UEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	UEDigraphTest.testNodeIterator(UEDigraph digraph, java.util.Set expected)
protected void	UEDigraphTest.testEdgeIterator(UEDigraph digraph)
protected void	UEDigraphTest.testGetNodes(UEDigraph digraph, java.util.Set expected)
protected void	UEDigraphTest.testGetEdges(UEDigraph digraph, java.util.Set expected)
protected void	UEDigraphTest.testContainsNodes(UEDigraph digraph, java.util.Set nodes, boolean expected)
protected void	UEDigraphTest.testContainsEdges(UEDigraph digraph, java.util.Set edges, boolean expected)
protected void	UEDigraphTest.testContainsUEDigraph(UEDigraph digraph, UEDigraph containedUEDigraph, boolean expected)
protected void	UEDigraphTest.testContainsUEDigraph(UEDigraph digraph, UEDigraph containedUEDigraph, boolean expected)
protected void	UEDigraphTest.testSameUEDigraphAs(UEDigraph digraph, UEDigraph containedUEDigraph, boolean expected)
protected void	UEDigraphTest.testSameUEDigraphAs(UEDigraph digraph, UEDigraph containedUEDigraph, boolean expected)