CONNECTIVITY

Lecture 2
Fleurys Algorithm

Let G be a connected graph.

If G is Eulerian then Fleurys algorithm will produce an

Eulerian path in G.

STEP 1: Choose any vertex v of G and set current vertex

equal to v and current path equal to the empty sequence of
edges.

STEP 2: Select any edge e incident with the current vertex

but choosing a bridge only if there is no alternative.

STEP 3: Add e to the current path and set the current
vertex equal to the vertex at the other end of e. [If e is a
loop, the current vertex will not move.]

STEP 4: Delete e from the graph. Delete any isolated

vertices.

Repeat steps 2 4 until all edges have been deleted from

G.

The final current path is an Eulerian path in G.

Current Path Current Vertex Next Vertex
A B
A-B B C
A-B-C C D
A-B-C-D D B
A-B-C-D-B B E
A-B-C-D-B-E E F
A-B-C-D-B-E-F F G
A-B-C-D-B-E-F-G G E
A-B-C-D-B-E-F-G-E E H
A-B-C-D-B-E-F-G-E-H H G
A-B-C-D-B-E-F-G-E-H-G G K
A-B-C-D-B-E-F-G-E-H-G-K K I
A-B-C-D-B-E-F-G-E-H-G-K-I I J
A-B-C-D-B-E-F-G-E-H-G-K-I-J J K
Current Path Current Next Vertex
Vertex
A-B-C-D-B-E-F-G-E-H-G-K-I-J-K K L
A-B-C-D-B-E-F-G-E-H-G-K-I-J-K-L L I
A-B-C-D-B-E-F-G-E-H-G-K-I-J-K-L-I I D
A-B-C-D-B-E-F-G-E-H-G-K-I-J-K-L-I-D D A

A-B-C-D-B-E-F-G-E-H-G-K-I-J-K-L-I-D-A A

The Eulerain circuit is A B C D B E F G E H G K I J K L I D A.