Package it.unive.lisa.util.datastructures.graph.algorithms

Interface Summary

Interface	Description
Fixpoint.FixpointImplementation<N,E,T>	Concrete implementation of the general methods used by a fixpoint algorithm to perform.

Class Summary

Class	Description
BackwardFixpoint<G extends Graph<G,N,E>,N extends Node<G,N,E>,E extends Edge<G,N,E>,T>	A backward fixpoint algorithm for a Graph, parametric to the Fixpoint.FixpointImplementation that one wants to use to compute the results.
Dominators<G extends Graph<G,N,E>,N extends Node<G,N,E>,E extends Edge<G,N,E>>	An algorithms that evaluates the dominators of each node in a graph.
Fixpoint<G extends Graph<G,N,E>,N extends Node<G,N,E>,E extends Edge<G,N,E>,T>	A fixpoint algorithm for a Graph, parametric to the Fixpoint.FixpointImplementation that one wants to use to compute the results.
SCCs<G extends Graph<G,N,E>,N extends Node<G,N,E>,E extends Edge<G,N,E>>	An algorithms that evaluates the strongly connected components a graph.

Exception Summary

Exception	Description
FixpointException	An exception raised during the fixpoint computation.