find a cycles in undirected graph
2 ビュー (過去 30 日間)
古いコメントを表示
My graph is something like this
(1,2)
(2,3)
(2,4)
(3,4)
(1,5)
(2,5)
(4,5)
(5,6)
(4,7)
(7,8)
(4,9)
(7,9)
(9,10)
(6,11)
(10,11)
(6,12)
(6,13)
(12,13)
(9,14)
(13,14)
I want to write a code that gives me this answer.
cycle_in_graph = {[1,2,5],[2,4,5],[2,3,4],[4,7,9],[6,12,13],[6,9,10,11,13,14],[4,5,6,9,10,11]};
1 件のコメント
Walter Roberson
2018 年 9 月 30 日
https://www.mathworks.com/matlabcentral/fileexchange/4266-grtheory-graph-theory-toolbox can find all independent cycles
There are some routines such as https://www.mathworks.com/matlabcentral/fileexchange/60814-cyclecount-a-l0 for counting cycles; perhaps they could be modified to return the cycles.
回答 (0 件)
参考
カテゴリ
Help Center および File Exchange で Undirected Graphs についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!