[Boost-users] Traversing a graph

Hi, I have a quick question about graph traversal: what is the appropriate algorithm to be used if I want to find the shortest distance between 2 specified vertices {v_s, v_d} such that every edge on the graph is traversed at least once? I've already used the breadth_first_search() and dijkstras_shortest_paths() for other problems wherein v_s = v_d. Seemingly, these algorithms cannot be used when the source and destination vertices are dissimilar. Thanks, Vipin