mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-28 06:55:02 +08:00
Add algorithm to find Hamiltonian cycle (#3151)
This commit is contained in:
@ -0,0 +1,39 @@
|
||||
package com.thealgorithms.datastructures.graphs;
|
||||
|
||||
import static org.junit.jupiter.api.Assertions.*;
|
||||
|
||||
import org.junit.jupiter.api.Test;
|
||||
|
||||
class HamiltonianCycleTest {
|
||||
|
||||
private HamiltonianCycle hamiltonianCycle = new HamiltonianCycle();
|
||||
|
||||
@Test
|
||||
void testFindHamiltonianCycleShouldReturnHamiltonianCycle() {
|
||||
int[] expectedArray = {0,1,2,4,3,0};
|
||||
int[][] inputArray = {
|
||||
{0, 1, 0, 1, 0},
|
||||
{1, 0, 1, 1, 1},
|
||||
{0, 1, 0, 0, 1},
|
||||
{1, 1, 0, 0, 1},
|
||||
{0, 1, 1, 1, 0}
|
||||
};
|
||||
|
||||
assertArrayEquals(expectedArray, hamiltonianCycle.findHamiltonianCycle(inputArray));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testFindHamiltonianCycleShouldReturnInfinityArray() {
|
||||
int[] expectedArray = {-1,-1,-1,-1,-1,-1};
|
||||
|
||||
int[][] inputArray = {
|
||||
{0, 1, 0, 1, 0},
|
||||
{1, 0, 1, 1, 1},
|
||||
{0, 1, 0, 0, 1},
|
||||
{1, 1, 0, 0, 0},
|
||||
{0, 1, 1, 0, 0}
|
||||
};
|
||||
|
||||
assertArrayEquals(expectedArray, hamiltonianCycle.findHamiltonianCycle(inputArray));
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user