Euler Path in a graph using Hierholzer's algorithm
We will discuss how to find the Euler path(path is a sequence of vertices connected by edges) in a graph. The assumption we are taking in this article is, the given graph is connected and there is a Euler path in the given graph, although we will discuss a criteria which will help us know if there is any Euler path in graph. Moreover, we will present the pseudo code of one of the algorithm and pick up a problem and solve it using the algorithm discussed in the aricle. Intro: Definition: Euler path is a path such that we travel all the edges of the graph exactly once (repetion of vertices is allowed). Euler path example In the above example, one of the Euler path is: 1,2,3,4,2,6,2,5 Euler path can be a closed path i.e. a cycle also called Euler circuit or it can be an open path as in the above example aslo called Euler walk. Prerequisite Degree of a ve