Click here to Skip to main content
Rate this: bad
Please Sign up or sign in to vote.
See more: Algorithms
I need to write a method to find the count of 4 cycles(cycles containing 4 edges) in an undirected graph. Please give me some advices if you have any idea about the algorithm.
Posted 1-Feb-13 3:43am
Andreas Gieriet at 2-Feb-13 6:10am
Why do you add a solution to your own questions. Use [Improve question] button here above and [x] delete your solution below.
Rate this: bad
Please Sign up or sign in to vote.

Solution 1

See Robert Sedgewick[^]'s book list: Part 5: Graph Algorithms is the book to read (you choose: C, C++, Java). It would be a nice exercise if you write all the code of the book in C#. Wink | ;-)
venera_soft at 2-Feb-13 2:06am
Thanks, will try :)
Rate this: bad
Please Sign up or sign in to vote.

Solution 2

I have done this myself. The algorithm uses DFS. And on every step it goes 4 levels and finds if the found vertex is the same as the one for which is done the step. In formal language it should be something like this:
for path in dfs(start=node, max_depth=4):
        if len(path) == 4 and path[1] == path[4]:

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
0 Sergey Alexandrovich Kryukov 240
1 CHill60 210
2 Peter Leow 170
3 Richard Deeming 166
4 Richard MacCutchan 159
0 Sergey Alexandrovich Kryukov 9,248
1 OriginalGriff 6,806
2 Peter Leow 4,432
3 Zoltán Zörgő 3,919
4 Richard MacCutchan 2,782

Advertise | Privacy | Mobile
Web03 | 2.8.150129.1 | Last Updated 2 Feb 2013
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100