Count all cycles in simple undirected graph

Version 1.2.0.0 (5,43 ko) par Jeff Howbert
Counts all cycles in a simple undirected graph up to specified size limit, using backtracking.
5.0
(2)
1,6K téléchargements
Mise à jour 29 août 2011

Afficher la licence

Counts all cycles in input graph up to (optional) specified size limit, using a backtracking algorithm. Designed for undirected graphs with no self-loops or multiple edges. Returns count of each size cycle from 3 up to size limit, and elapsed time.

Algorithm is guaranteed to find each cycle exactly once. It is essentially equivalent to Johnson (SIAM J. Comput. (1975), 4, 77), but for undirected graphs, and without the look-ahead feature. The lack of look-ahead is expected to have negligible performance impact on dense random graphs.

Reads input graph using separate m-file readGraph(), 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 much faster than the ILCA cycle counting algorithm posted by Joe Kirk (run_loops.m).

Citation pour cette source

Jeff Howbert (2024). Count all cycles in simple undirected graph (https://www.mathworks.com/matlabcentral/fileexchange/29438-count-all-cycles-in-simple-undirected-graph), MATLAB Central File Exchange. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R2011a
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Undirected Graphs dans Help Center et MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Publié le Notes de version
1.2.0.0

Wrong .zip file uploaded on previous submission.
1.1.0.0

Function cycleCountBacktrack now returns a vector containing counts of cycles, and elapsed time. (In previous version, counts and time were only output to console.)
1.0.0.0