Definition: The bridges of a connected graph are the edges whose removal disconnects the graph.

Fleury's algorithm (for a connected graph with all vertices of even valence):

  1. Pick any vertex as a starting point.
  2. Marking your path as you move from vertex to vertex, travel along any edges you wish except, DO NOT travel along an edge that is a bridge for the graph formed by the EDGES THAT HAVE YET TO BE TRAVELED-- unless you have to.
  3. Continue until you return to your starting point.