Study of Different algorithm in Euler Graph

Abstract

In this paper we discuss about the algorithm to constructing an Euler Path in Euler Graph .There are many algorithm available to constructing an Path in Euler Graph, but in this paper we study mainly two algorithm i.e. Fleury’s & Hierholzer’s. Both are very important algorithm for determination of Euler path in Euler graph. Also both algorithms are different and more effective than simple algorithm.