icentral-largest-bcc vs payback vs icentral-cycle

A Rust crate for computing and analyzing the largest biconnected components in graphs, providing insights into node and edge distributions in terms of centrality metrics.

Calculate to resolve debt networks with as few transactions as possible.

This crate provides tools to represent and compute the Minimum Cycle Basis of a graph, offering efficient access and manipulation of cycles for algorithmic and theoretical analysis.