We show that the time for a random walk to cover all the edges of a graph with m edges is bounded by 2m^2; if all edges must be covered in both directions, 3m^2. These results generalize to graphs with edge-lengths (even with infinitely many vertices) and to Brownian motion. Joint work with Agelos Georgakopoulos. *This talk will be held in SMI 311.