Uses of Interface
net.walend.digraph.IndexedDigraph

Packages that use IndexedDigraph

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.

Uses of IndexedDigraph in net.walend.digraph

Subinterfaces of IndexedDigraph in net.walend.digraph

interface	IndexedCEDigraph CEDigraph methods that use indices.
interface	IndexedGEDigraph GEDigraph methods that use indices.
interface	IndexedMutableCEDigraph Indexed mutators
interface	IndexedMutableGEDigraph Indexed mutators

Classes in net.walend.digraph that implement IndexedDigraph

class	AbstractLMCEDigraph An extension of AbstractMatrixCEDigraph that keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	AbstractLMGEDigraph An extension of AbstractMatrixGEDigraph 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	AbstractMatrixGEDigraph A GEDigraph backed by an ArrayList of nodes and a boolean[][] matrix that stores edges.
class	LMCEDigraph This class implements the CEDigraph interface using a Matrix and an array to speed up some indexed operations.
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	MatrixCEDigraph This class implements the CEDigraph interface using a Matrix.
class	MatrixGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix.
class	MutableLMCEDigraph
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	MutableMatrixCEDigraph
class	MutableMatrixGEDigraph A MutableGEDigraph backed by an ArrayList of nodes and a boolean[][] matrix of edges.

Uses of IndexedDigraph in net.walend.digraph.path

Subinterfaces of IndexedDigraph 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 IndexedDigraph

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.

Uses of IndexedDigraph in net.walend.measured

Subinterfaces of IndexedDigraph 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 IndexedDigraph

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