A Java implementation of two classical graph algorithms — sink elimination and iterative DFS cycle detection — to determine whether a directed graph is acyclic (a DAG) or cyclic, and if cyclic, to ...

This library solves the problem of working with graphs in a structured, reusable way. It provides implementations of essential graph algorithms that are commonly used in computer science applications, ...