Tag Archives: Euler-Circuit

Chinese Postman or Route Inspection | Set 1 (introduction)

Chinese Postman Problem is a variation of Eulerian circuit problem for undirected graphs. An Euler Circuit is a closed walk that covers every edge once starting and ending position is same. Chiniese Postman problem is defined for connected and undirected graph. The problem is to find shortest path or circuity that visits every edge of… Read More »

Hierholzer’s Algorithm for directed graph

Given a directed Eulerian graph, print an Euler circuit. Euler circuit is a path that traverses every edge of a graph, and the path ends on the starting vertex. Examples: Input : Adjacency list for the below graph Output : 0 -> 1 -> 2 -> 0 Input : Adjacency list for the below graph… Read More »