Hierholzer Eulerian
hierholzerEulerian(graph) constructs a path that uses every edge exactly once by splicing closed walks. It accepts an undirected adjacency list or Graph<N, W> and returns absence when no Eulerian path exists.
| Signature | Returns | Complexity |
|---|---|---|
hierholzerEulerian(graph: usize[][]) | usize[]? | O(V + E) |
hierholzerEulerian(graph: Graph<N, W>) | usize[]? | O(V + E) |
The adjacency list represents an undirected graph with symmetric entries. A successful path has E + 1 vertices.
Example
tyrus
import { hierholzerEulerian } from "tyrus:algorithm";
const path: usize[]? = hierholzerEulerian([[1, 2], [0, 2], [0, 1]]);
if (path) {
print(path.length); // 4
}Study result
hierholzerEulerianInfo returns the path together with edge and stack-operation metrics. Import both the base and specialized interfaces explicitly.
tyrus
interface HierholzerEulerianInfo {
path: usize[]?;
usedEdgeCount: usize;
examinedEdgeCount: usize;
isCircuit: bool;
stackPushCount: usize;
stackPopCount: usize;
joinedCycleCount: usize;
}tyrus
import { EulerianInfo, HierholzerEulerianInfo, hierholzerEulerianInfo } from "tyrus:algorithm";
const graph: usize[][] = [[1, 2], [0, 2], [0, 1]];
const info: HierholzerEulerianInfo = hierholzerEulerianInfo(graph);
print(info.path ?? []); // [0, 2, 1, 0]
print(info.usedEdgeCount); // 3
print(info.examinedEdgeCount); // 6
print(info.isCircuit); // true
print(info.stackPushCount); // 7
print(info.stackPopCount); // 7
print(info.joinedCycleCount); // 1