min-ratio-cycle: Fast minimum cost-to-time ratio cycle detection in directed graphs
Abstract
A high-performance Python library for finding minimum cost-to-time ratio cycles in directed graphs. Features NumPy-accelerated algorithms with exact Stern-Brocot search for integer inputs, comprehensive validation, performance analytics, and visualization tools.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Graph Theory and Algorithms
Algorithms and Data Compression
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 13 March 2026
- Language
- EN