Module paths 

Path algorithms for graphs

This module contains algorithms for finding special paths in graphs, including Eulerian and Hamiltonian paths.

Enums

EulerianType

Result of Eulerian path/circuit check

Functions

eulerian_type

Checks if a graph has an Eulerian path or circuit

has_hamiltonian_circuit

Checks if a graph has a Hamiltonian circuit (cycle visiting every vertex exactly once)

has_hamiltonian_path

Checks if a graph has a Hamiltonian path (visiting every vertex exactly once)