Function ADS::hamiltonianCycle

• Defined in File Problems.h

Function Documentation

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

an oriented cycle through every node once (n >= 2), or nothing

Pre:

G is square

Post:

a cycle returned visits each node once along the edges