#### Answer

Fleury's, bridge

#### Work Step by Step

Euler's Theorem enables us to count a graph's odd vertices and determine if it has an Euler path or an Euler circuit. A procedure for finding such paths is called Fleury's Algorithm. When using this algorithm and faced with a choice of edges to trace, choose an edge that is not a bridge. Travel over such an edge only if there is no alternative.