From: Alejandro Aragón (aaragon2_at_[hidden])
Date: 2006-07-27 21:20:56
Hello, I'm working with undirected graphs and I was wondering if there
is an algorithm that traverses all the edges in the graph in such a way
that this task is optimized. That is, if you draw a graph with a
pencil, the number of times that you should lift the tip of the pencil
is minimized. Can anyone give me a hint on this?
Thanks,
Alex