Uses of Interface
ix.util.DirectedGraph

Packages that use DirectedGraph

ix.iplan	The I-X planner.
ix.util	General-purpose utilities.

Uses of DirectedGraph in ix.iplan

Fields in ix.iplan declared as DirectedGraph

protected DirectedGraph	DomainAnalyser.possibleConditionsTable
protected DirectedGraph	DomainAnalyser.possibleConstraintsTable
protected DirectedGraph	DomainAnalyser.possibleEffectsTable
protected DirectedGraph	DomainAnalyser.possibleUseForEffectsTable
protected DirectedGraph	DomainAnalyser.refinementToDirectSuccessors
protected DirectedGraph	DomainAnalyser.refinementToReachableRefinements

Methods in ix.iplan that return DirectedGraph

protected DirectedGraph	DomainAnalyser.buildRefinementSuccessorTable()
DirectedGraph	DomainAnalyser.getUnexpandableNodes()

Methods in ix.iplan with parameters of type DirectedGraph

(package private) static void

DomainAnalyser.printGraph(java.lang.String label, DirectedGraph g)

Uses of DirectedGraph in ix.util

Subinterfaces of DirectedGraph in ix.util

interface	BoundedGraph A simple "view" interface for directed graphs that have unique start and finish nodes.
interface	TransitiveClosure The transitive closure of a relation that can be treated as directed graph.

Classes in ix.util that implement DirectedGraph

class	AbstractDirectedGraph A utility class that makes it easier to define a DirectedGraph.
class	DAGTransitiveClosure The transitive closure of a directed acyclic graph (DAG).
class	FullTransitiveClosure The transitive closure of a relation (cycles are allowed).

Fields in ix.util declared as DirectedGraph

(package private) DirectedGraph	FullTransitiveClosure.baseGraph
(package private) DirectedGraph	DAGTransitiveClosure.baseGraph

Methods in ix.util that return DirectedGraph

static DirectedGraph	Graphs.makeDirectedGraph(java.util.Collection roots, Function1 f) Makes a directed graph from a collection of root vertices and a function that maps each vertex to its successors.
static DirectedGraph	Graphs.makeDirectedGraph(java.util.Map map) Makes a directed graph from a map that maps each vertex to its successors.
static DirectedGraph	Graphs.makeReflexive(DirectedGraph g) Returns a graph in which each vertex has an edge back to itself.
static DirectedGraph	Graphs.transpose(DirectedGraph g) Returns a graph in which vertex-to-successor edges go in the opposite direction from those in the original graph.

Methods in ix.util with parameters of type DirectedGraph

void	FanComposer.apply(DirectedGraph g)
static DAGTransitiveClosure	Graphs.dagTransitiveClosure(DirectedGraph g) Transitive closure of a directed acyclic graph (DAG).
static java.util.Map	Graphs.findLongestPathLengths(DirectedGraph g) DAG Longest-path-lengths algorithm.
static BoundedGraph	Graphs.makeBoundedGraph(DirectedGraph g) Makes a BoundedGraph from a DirectedGraph by adding start and finish nodes.
static BoundedGraph	Graphs.makeBoundedGraph(DirectedGraph g, Function0 nodeFactory) Makes a BoundedGraph from a DirectedGraph by adding start and finish nodes.
static DirectedGraph	Graphs.makeReflexive(DirectedGraph g) Returns a graph in which each vertex has an edge back to itself.
static java.util.Set	Graphs.maximalElements(DirectedGraph g) Returns a set containing the vertices that have no successors.
static java.util.Set	Graphs.minimalElements(DirectedGraph g) Returns a set containing the vertices that have no predecessors.
static java.util.Map	Graphs.toMap(java.util.Map m, DirectedGraph g) Extends a map by adding a mapping from each vertex in a directed graph to the vertex's successors in that graph.
static java.util.List	Graphs.topologicalSort(DirectedGraph g) DAG topological sort, returning ancestors before descendents.
static FullTransitiveClosure	Graphs.transitiveClosure(DirectedGraph g) Transitive closure of a relation.
static DirectedGraph	Graphs.transpose(DirectedGraph g) Returns a graph in which vertex-to-successor edges go in the opposite direction from those in the original graph.

Constructors in ix.util with parameters of type DirectedGraph

DAGTransitiveClosure(DirectedGraph g)

FullTransitiveClosure(DirectedGraph g)