Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
432 views2 pages

Fleury's Algorithm

Fleury's algorithm provides a method for finding an Euler circuit in a graph. It involves starting at any vertex, traversing edges to neighboring unvisited vertices, and marking the traversed edges until returning to the starting point. An important rule is to never cross a bridge in the reduced graph (graph with traversed edges removed) unless necessary, to ensure a complete circuit can be found. The algorithm is illustrated with an example graph, showing the marked graph and reduced graph at each step.

Uploaded by

Vikesh Sohotoo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
432 views2 pages

Fleury's Algorithm

Fleury's algorithm provides a method for finding an Euler circuit in a graph. It involves starting at any vertex, traversing edges to neighboring unvisited vertices, and marking the traversed edges until returning to the starting point. An important rule is to never cross a bridge in the reduced graph (graph with traversed edges removed) unless necessary, to ensure a complete circuit can be found. The algorithm is illustrated with an example graph, showing the marked graph and reduced graph at each step.

Uploaded by

Vikesh Sohotoo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

3/18/2015

Fleury'sAlgorithm

5.6Fleury'sAlgorithmor...
Howtobuildacircuitwithoutwires
Topics
Introduction
Fleury'sAlgorithm

Introduction
Euler'sTheoremsareexamplesofexistencetheorems
existencetheoremstellwhetherornotsomethingexists(e.g.Eulercircuit)
butdoesn'ttellushowtocreateit!
wewantaconstructivemethodforfindingEulerpathsandcircuits
methods(welldefinedprocedures,recipes)forconstructionarecalledalgorithms
thereisanalgorithmforconstructinganEulercircuit:Fleury'salgorithm
wewillillustrateitwiththegraph:

Fleury'sAlgorithm
1.pickanyvertextostart
2.fromthatvertexpickanedgetotraverse(seebelowforimportantrule)
3.darkenthatedge,asareminderthatyoucan'ttraverseitagain
4.travelthatedge,comingtothenextvertex
5.repeat24untilalledgeshavebeentraversed,andyouarebackatthestartingvertex
ateachstageofthealgorithm:
theoriginalgraphminusthedarkened(alreadyused)edges=reducedgraph
importantrule:nevercrossabridgeofthereducedgraphunlessthereisnootherchoice
whymustweobservethatrule?
Notes:
thesamealgorithmworksforEulerpaths
beforestarting,useEulerstheoremstocheckthatthegraphhasanEulerpathand/orcircuitto
find!
whenyoudothisonpaper,youcaneraseeachedgeasyoutraverseit
thiswillmakethereducedgraphvisible,anditsbridgesapparent
http://www.austincc.edu/powens/+Topics/HTML/056/056.html#fleury

1/2

3/18/2015

Fleury'sAlgorithm

Example
Stepinrecipe

Markedgraph

Reducedgraph

Pickanyvertex(e.g.
F)

TravelfromFtoC
(arbitrarychoice)

TravelfromCtoD
(arbitrary)

TravelfromDtoA
(arbitrary)

TravelfromAtoC
(can'tgotoB:that
edgeisabridgeofthe
reducedgraph,and
therearetwoother
choices,wechoseone
ofthem)
Therestofthetripisobvious,andthecompleteEulercircuitis:
(F,C,D,A,C,E,A,B,D,F)

http://www.austincc.edu/powens/+Topics/HTML/056/056.html#fleury

2/2

You might also like