Jadecy

Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort).

It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices).

Since version 1.1, can also compute shortest cycles covering all edges of SCCs.

Usage from command line is also possible but with reduced flexibility (cf. JadecyMain class).

API entry point for Java code dependencies is the Jadecy class, or DepUnit that makes use of it and is designed for unit tests.

API entry point for general graph computations is the net.jadecy.graph package.

Requires Java 5 or later.

Also available on github:
https://github.com/jeffhain/jadecy