Uses of Interface
net.walend.digraph.IndexedCEDigraph

Packages that use IndexedCEDigraph

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

Subinterfaces of IndexedCEDigraph in net.walend.digraph

interface

IndexedMutableCEDigraph Indexed mutators

Classes in net.walend.digraph that implement IndexedCEDigraph

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	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	MutableLMCEDigraph
class	MutableMatrixCEDigraph

Uses of IndexedCEDigraph in net.walend.digraph.path

Subinterfaces of IndexedCEDigraph in net.walend.digraph.path

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	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 IndexedCEDigraph

class	AbstractDelegateDigraphOfCEPaths This class implements the DigraphOfCEPaths by delegating to an underlying IndexedMutableCEDigraph.
class	AbstractDelegateDigraphOfGEPaths This class implements the DigraphOfGEPaths by delegating to an underlying IndexedMutableCEDigraph.

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

private IndexedCEDigraph

AbstractDelegateDigraphOfCEPaths.base

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

IndexedCEDigraph	AbstractDelegateDigraphOfCEPaths.getBase()
IndexedCEDigraph	DigraphOfCEPaths.getBase()

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

protected void

AbstractDelegateDigraphOfCEPaths.initWithNodesFrom(IndexedCEDigraph digraph) Initialize this with the nodes from digraph at the same index values as in digraph.

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

AbstractDelegateDigraphOfCEPaths(IndexedCEDigraph ceDigraph)

AbstractDelegateDigraphOfCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate)

Uses of IndexedCEDigraph in net.walend.measured

Subinterfaces of IndexedCEDigraph in net.walend.measured

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 IndexedCEDigraph

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.
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.
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.

Fields in net.walend.measured declared as IndexedCEDigraph

private IndexedCEDigraph	CEBellmanFordTest.BFCEDigraph.digraph
private IndexedCEDigraph	AbstractShortestCEDistances.base

Methods in net.walend.measured that return IndexedCEDigraph

IndexedCEDigraph	ShortestCEDistances.getBase()
IndexedCEDigraph	AbstractShortestCEDistances.getBase()

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

static void	BellmanFordTest.test(IndexedCEDigraph ceDigraph, PathMeter pathMeter) Deprecated. Use CEBellmanFordTest
protected void	DijkstraShortestCEPaths.initWithNodesFrom(IndexedCEDigraph digraph)
static void	CEBellmanFordTest.test(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
protected void	DijkstraShortestCEDistances.initWithNodesFrom(IndexedCEDigraph digraph)

Constructors in net.walend.measured with parameters of type IndexedCEDigraph

AbstractShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)

FloydWarshallShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

JohnsonShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

JITShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

DijkstraShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

DijkstraShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)

CEBellmanFordTest(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

CEBellmanFordTest.BFCEDigraph(IndexedCEDigraph digraph)

JohnsonShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

JohnsonShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)

FloydWarshallShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

FloydWarshallShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)

AbstractShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

DijkstraShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

JITShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

JITShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)

Uses of IndexedCEDigraph in net.walend.measured.test

Methods in net.walend.measured.test with parameters of type IndexedCEDigraph

protected abstract ShortestCEDistances	ShortestCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
protected ShortestCEDistances	JohnsonCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
protected ShortestCEPaths	FloydWarshallCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEPaths	JohnsonCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEDistances	JITCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
protected abstract ShortestCEPaths	ShortestCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEPaths	CEPathsFromShortestDistancesTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEPaths	JITCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEDistances	FloydWarshallCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)