@Test
	public void testGetSuccessors() {
		Set<Integer> successors = new HashSet<>();
		for (int i = 10; i <= 20; i++) {
			successors.add(i);
		}

		Set<Integer> successorsSet = graphPath.getSuccessors(10);
		assertEquals(successors, successorsSet);
	}
Test to verify if getSuccessors() function works correctly. At setUp() a GraphPath is
created containing 21 vertices, with the last vertex having integer 20. This test creates a
new set with integers 10-20. Then assertEquals checks if the set returned by
getSuccessors() is the same as this set.
Ghidra/Framework/Graph/src/test.slow/java/ghidra/graph/GraphPathTest.java