Hierholzer eulerian

Open ArpitaHanjagi opened this issue 2 months ago • 1 comments

Algorithm: Hierholzer’s Algorithm

Purpose: Finds an Eulerian circuit in a graph, visiting every edge exactly once.

Theory: Starts at any vertex and follows edges to form a cycle; additional cycles are merged until all edges are used. Works for undirected graphs with all vertices of even degree or directed graphs with in-degree = out-degree.

Time Complexity: O(E)

Space Complexity: O(V + E)

Input: Graph as an adjacency list.

Output: Eulerian circuit as a sequence of vertices.

Oct 20 '25 18:10 ArpitaHanjagi

This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

Nov 27 '25 00:11 github-actions[bot]

This PR was closed because it has been stalled for 7 days with no activity.

Dec 05 '25 00:12 github-actions[bot]