cyclic-toposort. Implements sorting algorithm for directed acyclic as well as cyclic graphs. The directed cyclic graphs are sorted by determining the minimal amount of cyclic edges and optionally then also determining the maximum amount of groupings possible with a minimal amount of cyclic edges.

Problem

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Audience

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Market

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Pricing

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.