An analyzer used to find the longest path from a single source.
A base class for cached analyzers on graphs.
Strategy for cluster transformers for graphs.
Computation of the all pair shortest path of a directed graph using the Floyd-Warshall algorithm.
Computation of cycle existence in directed graphs using an all pair shortest path algorithm based on the Floyd-Warshall algorithm.
Analyzer to check if a given directed graph has a negative cycle using the Floyd-Warshall all pair shortest path algorithm.
Base class for all the analysis based on a floyd-warshall like computation.
Computation of transitive closure of a directed graph using the Floyd-Warshall algorithm described in: Thomas H.
Analyzer to check if a given directed graph has a zero cycle using the Floyd-Warshall all pair shortest path algorithm.
An analyzer for computing the maximum/minimum cycle mean of a graph.
A mirror transformer for graphs.
Maximum profit to cost ratio analyzer which uses Parhi's algorithm for iteration bound.
Computation of self-loops in a graph.
Computation of sink nodes in a graph.
Computation of source nodes in a graph.
A base class for all the strategies.