it seems so hard...
i use Euler Tour Skill to see if i can walk around the
stiches as more as i can...
but i failed@@
what's wrong?

You don't need to generate the Euler tours to see if they
exist, do you?
This problem is almost equivalent to finding connected
components.

> You don't need to generate the Euler tours to see if they
> exist, do you?
> This problem is almost equivalent to finding connected
> components.
i have thought all night...
how do you built the graph?
i mean there are serveral cases could destory my ideas...