An analysis to compute of the all pair shortest path of a directed graph.
A base class for analyses on graphs.
Given a collection of nodes in a graph, replace the subgraph induced by the nodes with a single node N.
Analyzes a directed graph and detects the existence of cycles.
An analysis to calculate the maximum/minimum cycle mean of a directed cyclic graph.
Maximum profit to cost ratio analysis.
A mirror transformations on graphs.
Analysis to check if a cyclic directed graph has a negative-length cycle.
Computation of self-loops in a graph.
An analysis to find the longest path from a single source to all the other nodes in a directed graph.
Computation of sink nodes in a graph.
Computation of source nodes in a graph.
An analysis for the computation of transitive closure of a directed graph.
Analysis to check if a cyclic directed graph has a zero-length cycle.
Base exception for non-checked exceptions in the analyses package.
Invalid analyzer plugged into an analysis.