CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 2 of 2
  1. March 1st, 2012, 08:00 PM #1
    ToshX
    ToshX is offline Junior Member
    Join Date
    Mar 2012
    Posts
    1

    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 ?
    Reply With Quote Reply With Quote
  2. March 2nd, 2012, 12:15 AM #2
    BioPhysEngr's Avatar
    BioPhysEngr
    BioPhysEngr is offline Moderator
    Join Date
    Feb 2011
    Location
    United States
    Posts
    1,016

    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,

    BioPhysEngr
    http://blog.biophysengr.net
    --
    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.
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

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

Forum Rules




Click Here to Expand Forum to Full Width

Featured