Function ADS::hamiltonianCircuit

• Defined in File Problems.h

Function Documentation

inline std::optional<Nodes> ADS::hamiltonianCircuit(const Adjacency &G)

an unoriented circuit through every node once (n >= 3), or nothing

Pre:

G is unoriented, i.e., square and symmetric

Post:

a circuit returned visits each node once along the edges