Euler Circuit
Definition: A cycle that includes all the edges and all the vertices
Fleury’s Algorithm
1. start at any vertex
traverse edges -- erasing as you go
2. never choose a "bridge" if you have another choice
(never choose edge which disconnects remaining graph)
Return to CIS 350 Index Page