CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 2 of 2
  1. #1
    Join Date
    Mar 2012

    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 ?

  2. #2
    Join Date
    Feb 2011
    United States

    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!
    Best Regards,

    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.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Windows Mobile Development Center

Click Here to Expand Forum to Full Width

On-Demand Webinars (sponsored)

We have made updates to our Privacy Policy to reflect the implementation of the General Data Protection Regulation.