Count all cycles in simple undirected graph

Versión 1.2.0.0 (5,43 KB) por Jeff Howbert
Counts all cycles in a simple undirected graph up to specified size limit, using backtracking.
5.0
(2)
1,6K descargas
Actualizado 29 ago 2011

Ver licencia

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).

Citar como

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. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2011a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Undirected Graphs en Help Center y MATLAB Answers.
Agradecimientos

Inspiración para: PM Architectures Project, Count cycles in bipartite graphs

Community Treasure Hunt

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

Start Hunting!

Versión Publicado Notas de la versión
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