Class HamiltonianAllTest
java.lang.Object
topics.backtracking.tsp.HamiltonianAllTest
Validation Suite for Exhaustive Hamiltonian Cycles
Verifies that the brute-force search mathematically explores the entire state space, resulting in exactly (N-1)! cycles for a fully connected graph.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
HamiltonianAllTest
HamiltonianAllTest()
-
-
Method Details
-
testCompleteGraphPermutations
@Test @DisplayName("Should find exactly (N-1)! unique Hamiltonian cycles in a complete graph") void testCompleteGraphPermutations()
-