Scribd Logo
Upload

Welcome to Scribd!

  • Fleury's Algorithm

    Uploaded by

    Vikesh Sohotoo
    94 views2 pages
    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.

    Original Description:

    fleyru algoritum

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    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.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    94 views2 pages

    Fleury's Algorithm

    Uploaded by

    Vikesh Sohotoo
    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.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 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