CycleCount(A,L0)
Algorithm for counting simple cycles of any length on any (weighted directed) network.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Cite As
Pierre-Louis Giscard (2026). CycleCount(A,L0) (https://www.mathworks.com/matlabcentral/fileexchange/60814-cyclecount-a-l0), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.2.0 (3.79 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.2.0 | Now detects automatically if the graph is weighted or not and works accordingly in both situations without having to deactivate line 54. |
||
| 1.1.0 | Fixed a minor error in the published code causing the output for the number of simple cycles on some directed graphs to be faulty. Thanks to Evangelos Evangelou for pointing the error out. Publications based on CycleCount are not affected. |
||
| 1.0.0 |
