Four cycles in Graph

Question

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.

Posted 1-Feb-13 2:43am

venera_soft

Add a Solution

Comments

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

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

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

Andreas Gieriet · Answer 1 · 2013-02-01T04:41:00

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#. ;-)
Cheers
Andi

Posted 1-Feb-13 4:41am

Andreas Gieriet

Updated 1-Feb-13 4:43am

v4

Comments

venera_soft 2-Feb-13 2:06am

Thanks, will try :)

venera_soft · Answer 2 · 2013-02-01T20:12:00

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]:
            output.append(path)