Fleury's Algorithm

Fleury's algorithm is very important in allowing us to be able to construct an Eulerian trail given an Eulerian graph $$G$$ . We briefly describe this algorithm below.

Steps to Fleury's Algorithm

Step 1	Select any vertex to start with.
Step 2	Traverse any available edge starting with this vertex. Only traverse a bridge if there is no alternative edge to select.
Step 3	Repeat step 2 until there are no more edges left. The resulting trail will be an Eulerian trail (given an Eulerian graph).

Click here to edit contents of this page.

Click here to toggle editing of individual sections of the page (if possible). Watch headings for an "edit" link when available.

Append content without editing the whole page source.

Check out how this page has evolved in the past.

If you want to discuss contents of this page - this is the easiest way to do it.

View and manage file attachments for this page.

A few useful tools to manage this Site.

See pages that link to and include this page.

Change the name (also URL address, possibly the category) of the page.

View wiki source for this page without editing.

View/set parent page (used for creating breadcrumbs and structured layout).

Notify administrators if there is objectionable content in this page.

Something does not work as expected? Find out what you can do.

General Wikidot.com documentation and help section.

Wikidot.com Terms of Service - what you can, what you should not etc.

Wikidot.com Privacy Policy.

Mathonline

Learn Mathematics

Fleury's Algorithm

Steps to Fleury's Algorithm