Uses of Interface
net.walend.digraph.GEDigraph

Packages that use GEDigraph

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 GEDigraph in net.walend.digraph

Subinterfaces of GEDigraph in net.walend.digraph

interface	IndexedGEDigraph GEDigraph methods that use indices.
interface	IndexedMutableGEDigraph Indexed mutators
interface	MutableGEDigraph MutableGEDigraph adds mutators to the GEDigraph interface so that a developer can add and remove edges and nodes.

Classes in net.walend.digraph that implement GEDigraph

class	AbstractHashGEDigraph This abstract class implements the GEDigraph interface using two HashSets.
class	AbstractLMGEDigraph An extension of AbstractMatrixGEDigraph that keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	AbstractMatrixGEDigraph A GEDigraph backed by an ArrayList of nodes and a boolean[][] matrix that stores edges.
class	HashGEDigraph This class implements the GEDigraph interface using two HashMaps.
class	LMGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix and keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	MatrixGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix.
class	MutableHashGEDigraph
class	MutableLMGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix and keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	MutableMatrixGEDigraph A MutableGEDigraph backed by an ArrayList of nodes and a boolean[][] matrix of edges.

Fields in net.walend.digraph declared as GEDigraph

static GEDigraph

GEDigraph.EMPTY

Methods in net.walend.digraph that return GEDigraph

GEDigraph	AbstractHashGEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractHashGEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
GEDigraph	GEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	GEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
GEDigraph	AbstractMatrixGEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractMatrixGEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.

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

static boolean	GEDigraphAlgebra.containsGEDigraph(GEDigraph outer, GEDigraph inner) Returns true if inner is a subgraph of outer.
static boolean	GEDigraphAlgebra.containsGEDigraph(GEDigraph outer, GEDigraph inner) Returns true if inner is a subgraph of outer.
static boolean	GEDigraphAlgebra.sameGEDigraphs(GEDigraph dg1, GEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static boolean	GEDigraphAlgebra.sameGEDigraphs(GEDigraph dg1, GEDigraph dg2) Returns true if digraph is the same as this, and all their contents have the same state.
static void	GEDigraphAlgebra.intersectGEDigraphs(GEDigraph dg1, GEDigraph dg2, MutableGEDigraph intersection) Returns a GEDigraph containing the intersection of dg1 and dg2.
static void	GEDigraphAlgebra.intersectGEDigraphs(GEDigraph dg1, GEDigraph dg2, MutableGEDigraph intersection) Returns a GEDigraph containing the intersection of dg1 and dg2.
static void	GEDigraphAlgebra.unionGEDigraphs(GEDigraph dg1, GEDigraph dg2, MutableGEDigraph union) Returns a GEDigraph containing the intersection of dg1 and dg2.
static void	GEDigraphAlgebra.unionGEDigraphs(GEDigraph dg1, GEDigraph dg2, MutableGEDigraph union) Returns a GEDigraph containing the intersection of dg1 and dg2.
static java.lang.String	GEDigraphAlgebra.toString(GEDigraph digraph)
boolean	AbstractHashGEDigraph.containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	AbstractHashGEDigraph.sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
GEDigraph	AbstractHashGEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractHashGEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
private boolean	AbstractHashGEDigraph.removeEdges(GEDigraph digraph)
protected int	AbstractHashGEDigraph.removeGEDigraph(GEDigraph digraph) Return the number of edges orphaned when digraph is removed
boolean	GEDigraph.containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	GEDigraph.sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsGEDigraph(digraph) and digraph.containsGEDigraph(this).
GEDigraph	GEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	GEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
int	MutableMatrixGEDigraph.removeGEDigraph(GEDigraph digraph)
int	MutableHashGEDigraph.removeGEDigraph(GEDigraph digraph)
int	MutableGEDigraph.removeGEDigraph(GEDigraph digraph) Return the number of edges orphaned when digraph is removed
boolean	AbstractMatrixGEDigraph.containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	AbstractMatrixGEDigraph.sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsGEDigraph(digraph) and digraph.containsGEDigraph(this).
GEDigraph	AbstractMatrixGEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractMatrixGEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
protected int	AbstractMatrixGEDigraph.removeGEDigraph(GEDigraph digraph) Return the number of edges orphaned when digraph is removed
int	MutableLMGEDigraph.removeGEDigraph(GEDigraph digraph)

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

AbstractHashGEDigraph(GEDigraph digraph)

AbstractMatrixCEDigraph(GEDigraph digraph, java.lang.Object edge)

LMCEDigraph(GEDigraph digraph, java.lang.Object edge)

MutableLMCEDigraph(GEDigraph digraph, java.lang.Object edge)

AbstractLMCEDigraph(GEDigraph digraph, java.lang.Object edge)

HashGEDigraph(GEDigraph digraph)

AbstractHashCEDigraph(GEDigraph digraph, java.lang.Object edge)

MatrixGEDigraph(GEDigraph digraph)

MutableMatrixGEDigraph(GEDigraph digraph)

MutableHashGEDigraph(GEDigraph digraph)

HashCEDigraph(GEDigraph digraph, java.lang.Object edge)

AbstractMatrixGEDigraph(GEDigraph digraph)

LMGEDigraph(GEDigraph digraph)

MatrixCEDigraph(GEDigraph digraph, java.lang.Object edge)

MutableLMGEDigraph(GEDigraph digraph)

MutableMatrixCEDigraph(GEDigraph digraph, java.lang.Object edge)

MutableHashCEDigraph(GEDigraph digraph, java.lang.Object edge)

AbstractLMGEDigraph(GEDigraph digraph)

Uses of GEDigraph in net.walend.digraph.path

Subinterfaces of GEDigraph in net.walend.digraph.path

interface	GEPath GEPath is an interface for represtenting paths through GEDigraph.
interface	MutableGEPath MutableGEPath is an interface for represtenting mutable paths through GEDigraph.

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

protected static class	AbstractDelegateDigraphOfGEPaths.DigraphGEPath
class	AbstractListGEPath This abstract class implements the GEPath interface using a List of nodes.
class	ListGEPath This class implements the GEPath interface using two lists.
class	MutableListGEPath This class implements the MutableGEPath interface using a list.

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

private GEDigraph

AbstractListGEPath.digraph

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

GEDigraph	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.getSupergraph() Returns the base.
GEDigraph	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
GEDigraph	GEPath.getSupergraph() Returns the supergraph.
GEDigraph	AbstractListGEPath.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractListGEPath.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
GEDigraph	AbstractListGEPath.getSupergraph() Returns the supergraph.

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

boolean	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
GEDigraph	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.
static void	GEPathAlgebra.checkValid(GEPath path, GEDigraph digraph) Check that the path is valid on digraph.
boolean	AbstractListGEPath.containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	AbstractListGEPath.sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this, and all their contents have the same state.
GEDigraph	AbstractListGEPath.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	AbstractListGEPath.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.

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

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

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

MutableListGEPath(GEDigraph digraph, java.lang.Object node, java.util.List nodeList)
Creates a new path on digraph that has only node in it, using nodeList.

MutableListGEPath(GEDigraph digraph, java.util.List nodeList)
Creates a new path on digraph that has only nodeList nodes in it, using nodeList.

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

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

AbstractListGEPath(GEDigraph digraph, java.lang.Object node, java.util.List nodeList)
Creates a new path on digraph that has only node in it, using nodeList.

AbstractListGEPath(GEDigraph digraph, java.util.List nodeList)
Creates a new path on digraph that has only node in it, using nodeList.

ListGEPath(GEDigraph digraph, java.util.List nodeList)
Creates a new path on digraph that has only node in it, using nodeList.

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

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

protected GEDigraph	MutableListGEPathTest.getEmptyTestGEDigraph()
protected GEDigraph	MutableListGEPathTest.getTestGEDigraph()
protected GEDigraph	ListGEPathTest.getEmptyTestGEDigraph()
protected GEDigraph	ListGEPathTest.getTestGEDigraph()

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

void	GEPathTest.testGetSupergraph(GEPath path, GEDigraph expected)

Uses of GEDigraph in net.walend.digraph.test

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

static GEDigraph

TestGEDigraphFactory.GEDIGRAPH

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

protected GEDigraph	MutableLMGEDigraphTest.getEmptyTestGEDigraph()
protected GEDigraph	MutableLMGEDigraphTest.getTestGEDigraph()
protected abstract GEDigraph	GEDigraphTest.getEmptyTestGEDigraph()
protected abstract GEDigraph	GEDigraphTest.getTestGEDigraph()
protected GEDigraph	MutableMatrixGEDigraphTest.getEmptyTestGEDigraph()
protected GEDigraph	MutableMatrixGEDigraphTest.getTestGEDigraph()
protected GEDigraph	MatrixGEDigraphTest.getEmptyTestGEDigraph()
protected GEDigraph	MatrixGEDigraphTest.getTestGEDigraph()
protected GEDigraph	LMGEDigraphTest.getEmptyTestGEDigraph()
protected GEDigraph	LMGEDigraphTest.getTestGEDigraph()
protected GEDigraph	MutableHashGEDigraphTest.getEmptyTestGEDigraph()
protected GEDigraph	MutableHashGEDigraphTest.getTestGEDigraph()
protected GEDigraph	HashGEDigraphTest.getEmptyTestGEDigraph()
protected GEDigraph	HashGEDigraphTest.getTestGEDigraph()

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

protected void	GEDigraphTest.testNodeCount(GEDigraph digraph, int expected)
protected void	GEDigraphTest.testEdgeCount(GEDigraph digraph, int expected)
protected void	GEDigraphTest.testIsEmpty(GEDigraph digraph, boolean expected)
protected void	GEDigraphTest.testIsEdgeFree(GEDigraph digraph, boolean expected)
protected void	GEDigraphTest.testContainsNode(GEDigraph digraph, java.lang.Object node, boolean expected)
protected void	GEDigraphTest.testContainsEdge(GEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, boolean expected, boolean expectException)
protected void	GEDigraphTest.testContainsEdgeAllWays(GEDigraph digraph, java.lang.Object fromNode, java.lang.Object toNode, boolean expected, boolean expectException) Deprecated.
protected void	GEDigraphTest.testCountInboundEdges(GEDigraph digraph, java.lang.Object node, int expected, boolean expectException)
protected void	GEDigraphTest.testCountOutboundEdges(GEDigraph digraph, java.lang.Object node, int expected, boolean expectException)
protected void	GEDigraphTest.testGetToNodes(GEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	GEDigraphTest.testGetFromNodes(GEDigraph digraph, java.lang.Object node, java.util.Set expected, boolean expectException)
protected void	GEDigraphTest.testNodeIterator(GEDigraph digraph, java.util.Set expected)
protected void	GEDigraphTest.testEdgeNodeIterator(GEDigraph digraph)
protected void	GEDigraphTest.testGetNodes(GEDigraph digraph, java.util.Set expected)
protected void	GEDigraphTest.testContainsNodes(GEDigraph digraph, java.util.Set nodes, boolean expected)
protected void	GEDigraphTest.testContainsGEDigraph(GEDigraph digraph, GEDigraph containedGEDigraph, boolean expected)
protected void	GEDigraphTest.testContainsGEDigraph(GEDigraph digraph, GEDigraph containedGEDigraph, boolean expected)
protected void	GEDigraphTest.testSameGEDigraphAs(GEDigraph digraph, GEDigraph containedGEDigraph, boolean expected)
protected void	GEDigraphTest.testSameGEDigraphAs(GEDigraph digraph, GEDigraph containedGEDigraph, boolean expected)
protected void	GEDigraphTest.testToString(GEDigraph digraph)

Uses of GEDigraph in net.walend.measured

Subinterfaces of GEDigraph in net.walend.measured

interface

MeasuredGEPath

Classes in net.walend.measured that implement GEDigraph

private class	AbstractShortestGEPaths.DigraphMeasuredGEPath
private static class	GEBellmanFordTest.BFGEDigraph This is simply a wrapper of a GEDigraph that has a BFNode and BFEdges from that node to all nodes.

Methods in net.walend.measured that return GEDigraph

GEDigraph	GEBellmanFordTest.BFGEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	GEBellmanFordTest.BFGEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.

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

boolean	GEBellmanFordTest.BFGEDigraph.containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	GEBellmanFordTest.BFGEDigraph.sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsGEDigraph(digraph) and digraph.containsGEDigraph(this).
GEDigraph	GEBellmanFordTest.BFGEDigraph.intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
GEDigraph	GEBellmanFordTest.BFGEDigraph.unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.

Uses of GEDigraph in net.walend.measured.test

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

protected GEDigraph	ShortestGEPathTest.getEmptyTestGEDigraph()
protected GEDigraph	ShortestGEPathTest.getTestGEDigraph()