eulers circuit

what code would i need inorder to find out if a graph has a eulers circuit?

You should probably go visit Google before you get flamed into oblivion.

Quzah.

IDSPISPOPD

>>IDSPISPOPD
Isn't that the no-clip cheat for Doom Original?

**does double-take**
Hey, how'd you know my password?? :D

You'll need 1st to learn algorithms tocheck that. Being you graph a class which contains Nodes and Edges the task should be eased up a little.
Do a Google search. Some of the results are pretty good.

And for that matter, there are 2 cases to be considered:
A graph always has a Euler circuit If all nodes have a EVEN number of connections to other nodes, although there is one exception, quoted next...
Or:
A graph has a Euler circuit if only 2 and 2 only nodes have a ODD number of connections to other nodes. All other nodes must have a EVEN number of connection. In this case the circuit stats in one of the ODD nodes and ends in the other.

And if you want to calculate a euler's circuit, considering this, you only have to choose a starting node, then go all the way through all un-visited Edges. When you visit an Edge, you mark it as visited, then go to the next one, till you reach the end node. You count the number of visited edges. When they're all visited (count equals the number of edges), you have your euler circuit. But be careful when reaching a node to which all linked Edges are visited: it doesn't mean you've found a path. Better to count the number of Edges.