Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.2 Euler Paths and Euler Circuits - Exercise Set 14.2: 66

Answer

The purpose of Fleury's Algorithm is to find an Euler path or an Euler circuit in a graph.

Work Step by Step

If a connected graph has 0 odd vertices, then the graph has at least one Euler path and at least one Euler circuit. If a connected graph has exactly 2 odd vertices, then the graph has at least one Euler path. If we know that there is an Euler path or an Euler circuit in a graph, we can use Fleury's Algorithm to find one. The purpose of Fleury's Algorithm is to find an Euler path or an Euler circuit in a graph.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.