*/
EulerPath_Algorithm
Submitted By:
Unknown
Rating:
(
Rate It)
An Euler path (pronounced 'oiler') in a graph G is a path that
uses each arc of G exactly once and can exist in a connected
graph iff there are either no nodes whose degree is odd or
exactly two nodes whose degree is odd. For the case of no nodes
posessing an odd degree, the path can begin at any node and
will end there; for the case of two nodes posessing an odd
degree, the path must begin at one odd node and end at the
other.
NOTE: Some downloads must be obtained through publishers´s site.
Do you want to get your software listed on this site? Go to our
submissions area.
Screenshot
Details
Number of downloads:
3145
Comments (4)
Great stuff!
Posted on Wednesday, December 17, 2003
It was an urgent task to get the Euler path and this code helped me a lot! Thanks
Student
Posted by: a CS Student on Friday, January 21, 2005
That's great!!!
I'm just finding this algorithm!!
Thx for it!!!
amman
(Not rated)
Posted by: asma on Sunday, March 27, 2005
code to find euler paths in euler graph
21e12
Posted by: szc on Thursday, August 21, 2008
wdqd
Add Your Rating
