Backtracking
Generate a graph with a Hamiltonian cycle: a route that visits every vertex exactly once and returns to its starting vertex.
8 vertices · 15 edges
Generate a graph with a Hamiltonian cycle: a route that visits every vertex exactly once and returns to its starting vertex.
8 vertices · 15 edges