Unique identifier for edges in a multigraph.

Eulerian circuit algorithms for multigraphs.

An Eulerian circuit is a trail that visits every edge exactly once and returns to the starting vertex.

Multigraph data structure supporting parallel edges.

A multigraph allows multiple edges between the same pair of nodes, useful for modeling scenarios like: - Multi-modal transportation (different routes between cities) - Redundant network connections - Temporal graphs (same edge at different times) - Multiple relationship types (without using hypergraphs)

A multigraph that can hold multiple (parallel) edges between the same pair of nodes.

Traversal operations for multigraphs.

Control flow for walk operations.

Metadata for fold-style walks.