# Tag Archives: Euler-Circuit

## Minimum edges required to add to make Euler CircuitMay 7, 2017

Given a undirected graph of n nodes and m edges. The task is to find minimum edges required to make Euler Circuit in the given… Read More »

## Chinese Postman or Route Inspection | Set 1 (introduction)February 1, 2017

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… Read More »

## Hierholzer’s Algorithm for directed graphJanuary 22, 2017

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… Read More »

## Euler Circuit in a Directed GraphJuly 27, 2014

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the… Read More »

## Find if an array of strings can be chained to form a circle | Set 1July 23, 2014

Given an array of strings, find if the given strings can be chained to form a circle.

## Fleury’s Algorithm for printing Eulerian Path or CircuitAugust 3, 2013

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same… Read More »

## Eulerian path and circuit for undirected graphJune 13, 2013

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the… Read More »