Count all cycles size 3 to 9 in simple undirected graph
Counts all cycles of size 3 to 9 in input graph, using a pruned combinatorial enumeration specific for each size cycle. Designed for undirected graphs with no self-loops or multiple edges. Outputs count of each size cycle from 3 up to 9.
Algorithm is guaranteed to find each cycle exactly once.
Reads input graph using separate m-file readGraph.m, which supports reading a graph from a file or workspace array in four different formats. A test file for each format is included.
In practice this algorithm is considerably faster than the algorithm previously posted by the same author (cycleCountBacktrack.m), even when the size limit for the latter is set to 9.
Citation pour cette source
Jeff Howbert (2024). Count all cycles size 3 to 9 in simple undirected graph (https://www.mathworks.com/matlabcentral/fileexchange/32709-count-all-cycles-size-3-to-9-in-simple-undirected-graph), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.0.0.0 |