# Talk:Euler tour

Nice writeup. I noticed that what you call a bridge is already called Articulation_points. Maybe we should link them, or decide on a standard terminology? --Rrenaud 13:12, 25 Dec 2005 (EST) A bridge is an edge, while an articulation point is a point. I was going to do a writeup at some point (but to be honest, I was going to do a lot of things at some point.. ;) But ya, they're different. --Larry 13:57, 25 Dec 2005 (EST)

The definitions are flawed. Please use (and maybe link) standard graph theory terms, otherwise you will confuse many readers.
E.g., a path is a sequence v_0 e_1 v_1 ... e_n v_n, where v_i are vertices, e_i are edges, e_i connects v_{i-1} and v_i, and **all v_i are different**. Your attempted definitions simply confuse the words "path", "tour", "cycle", etc.
If nobody objects, I will fix it (soon :))

--Misof 15:10, 28 Dec 2005 (EST)

These definitions are from http://en.wikipedia.org/wiki/Euler_tour. Feel free to correct them. Sweepline 17:01, 28 Dec 2005 (EST)

Seems fine, though making their own (however short) article would be nice so that all graph theory stuff can just refer to it.. =) --Larry 17:28, 28 Dec 2005 (EST)

## "Cycle finding algorithm"[edit]

The "cycle finding algorithm" given here is incomprehensible. It can't possibly be right because there is no concept of path built into it. I suspect it is a badly presented backtrack search for a path, but that is a terrible way to find eulerian tours. 151.100.17.149 10:08, 5 June 2010 (UTC)

Yes, the algorithm is simply wrong! At no point does the pesudo-code do anything like searching for a cycle! This made me wasting 40mins -_- well next time I guess I should think before implementing something from the internet.