March 1st, 2012, 07:00 PM
Graph Algorithm Tip
Hi here is the thing:
I have a Graph, now I want to visit each edge from the graph just once.
Is there any algorithm that can solve this problem ?
March 1st, 2012, 11:15 PM
Re: Graph Algorithm Tip
This is called an Eulerian path which was first studied by Euler as the Seven Bridges of Koenigsberg problem.
You will find the conditions for the existance of such a path (and the algorithm for constructing them) at those links (or by a Google search for Eulerian path construction).
Hope that helps!
All advice is offered in good faith only. You are ultimately responsible for effects of your programs and the integrity of the machines they run on.
Click Here to Expand Forum to Full Width