Click here to Skip to main content
15,567,482 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
See more:
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.
Andreas Gieriet 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.

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#. ;-)
Share this answer
venera_soft 2-Feb-13 2:06am    
Thanks, will try :)
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]:
Share this answer

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

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900