28 Jul
2006
28 Jul
'06
1:20 a.m.
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