@Test
	public void testGetPredecessors() {
		Set<Integer> predecessors = new HashSet<>();
		for (int i = 0; i <= 10; i++) {
			predecessors.add(i);
		}

		Set<Integer> predecessorsSet = graphPath.getPredecessors(10);
		assertEquals(predecessors, predecessorsSet);
	}
Test to verify if getPredecessors() 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 0-10. Then assertEquals checks if the set returned by
getPredecessors() is equal as this set.
Ghidra/Framework/Graph/src/test.slow/java/ghidra/graph/GraphPathTest.java