In this section, you'll learn what Fleury's algorithm is, and how to use it to find an Euler circuit for connected graphs where the degree of each vertex is even. You'll also learn how to use the algorithm to find an Euler path for connected graphs where not more than two vertices have odd degree. Before attempting this section, you should know how Euler circuits and paths are characterized. You should also have experience finding Euler circuits and paths by trial and error.
