Uses of Interface
net.walend.digraph.Digraph

Packages that use Digraph

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

Subinterfaces of Digraph in net.walend.digraph

interface	CEDigraph CEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.
interface	GEDigraph GEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.
interface	IndexedCEDigraph CEDigraph methods that use indices.
interface	IndexedDigraph IndexedDigraph adds index methods to a Digraph.
interface	IndexedGEDigraph GEDigraph methods that use indices.
interface	IndexedMutableCEDigraph Indexed mutators
interface	IndexedMutableGEDigraph Indexed mutators
interface	MutableCEDigraph MutableCEDigraph adds mutators to the CEDigraph interface so that a developer can add and remove edges and nodes.
interface	MutableGEDigraph MutableGEDigraph adds mutators to the GEDigraph interface so that a developer can add and remove edges and nodes.
interface	MutableUEDigraph MutableUEDigraph adds mutators to the UEDigraph interface so that a developer can add and remove edges and nodes.
interface	UEDigraph UEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.

Classes in net.walend.digraph that implement Digraph

class	AbstractHashCEDigraph This abstract class implements the CEDigraph interface using a Map and a Set.
class	AbstractHashGEDigraph This abstract class implements the GEDigraph interface using two HashSets.
class	AbstractHashUEDigraph This abstract class implements the UEDigraph interface using three HashMaps.
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	AbstractMatrixUEDigraph This abstract class implements the UEDigraph interface using a List and a Grid.
class	HashCEDigraph This class implements the CEDigraph interface using a Map and a Set.
class	HashGEDigraph This class implements the GEDigraph interface using two HashMaps.
class	HashUEDigraph This class implements the UEDigraph interface using three HashMaps.
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	MatrixUEDigraph This class implements the UEDigraph interface using a List and a Grid.
class	MutableHashCEDigraph
class	MutableHashGEDigraph
class	MutableHashUEDigraph
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.
class	MutableMatrixUEDigraph

Uses of Digraph in net.walend.digraph.path

Subinterfaces of Digraph 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	GEPath GEPath is an interface for represtenting paths through GEDigraph.
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.
interface	MutableGEPath MutableGEPath is an interface for represtenting mutable paths through GEDigraph.
interface	MutableUEPath MutableUEPath is an interface for represtenting mutable paths through UEDigraph.
interface	Path Path is an interface for representing paths through Digraphs.
interface	UEPath UEPath is an interface for represtenting paths through UEDigraph.

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

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.
protected static class	AbstractDelegateDigraphOfGEPaths.DigraphGEPath
class	AbstractListCEPath This abstract class implements the CEPath interface using a List of nodes and a List of Edges.
class	AbstractListGEPath This abstract class implements the GEPath interface using a List of nodes.
class	AbstractListUEPath This abstract class implements the UEPath interface using a List of nodes and a List of Edges.
class	ListCEPath This class implements the CEPath interface using two lists.
class	ListGEPath This class implements the GEPath interface using two lists.
class	ListUEPath This class implements the UEPath interface using two lists.
class	MutableListCEPath This class implements the MutableCEPath interface using two lists.
class	MutableListGEPath This class implements the MutableGEPath interface using a list.
class	MutableListUEPath This class implements the MutableUEPath interface using two lists.

Uses of Digraph in net.walend.measured

Subinterfaces of Digraph in net.walend.measured

interface	MeasuredCEPath
interface	MeasuredGEPath
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 Digraph

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.
private class	AbstractShortestGEPaths.DigraphMeasuredGEPath
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.
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.