From a3d28d9ea91f90af072066b2a77030e929ab0f0e Mon Sep 17 00:00:00 2001 From: Haidong Ji Date: Wed, 20 May 2020 18:37:36 -0500 Subject: Check if DAG (Directed Acyclic Graph) done. In the exercise it's Checking Consistency of CS Curriculum. For the clock variable to assign pre-visit and post-visit values, I used a trick of defining the clock as int[1], so its mutable and I can increment it. I don't know if that's a best practice, but for now I'm happy that the program is good. Fun stuff! --- src/test/AcyclicityTest.java | 55 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 src/test/AcyclicityTest.java (limited to 'src/test/AcyclicityTest.java') diff --git a/src/test/AcyclicityTest.java b/src/test/AcyclicityTest.java new file mode 100644 index 0000000..9d67894 --- /dev/null +++ b/src/test/AcyclicityTest.java @@ -0,0 +1,55 @@ +import org.junit.jupiter.api.Test; + +import java.util.ArrayList; + +import static org.junit.jupiter.api.Assertions.*; + +class AcyclicityTest { + + @Test + void test() { + ArrayList> adj = new ArrayList<>(); + for (int i = 0; i < 4; i++) { + adj.add(new ArrayList<>()); + } + + adj.get(0).add(1); + adj.get(3).add(0); + adj.get(1).add(2); + adj.get(2).add(0); + + assertEquals(1, Acyclicity.acyclic(adj)); + } + + @Test + void test1() { + ArrayList> adj = new ArrayList<>(); + for (int i = 0; i < 5; i++) { + adj.add(new ArrayList<>()); + } + + adj.get(0).add(1); + adj.get(1).add(2); + adj.get(0).add(2); + adj.get(2).add(3); + adj.get(0).add(3); + adj.get(1).add(4); + adj.get(2).add(4); + + assertEquals(0, Acyclicity.acyclic(adj)); + } + + @Test + void test2() { + ArrayList> adj = new ArrayList<>(); + for (int i = 0; i < 4; i++) { + adj.add(new ArrayList<>()); + } + + adj.get(0).add(1); + adj.get(2).add(1); + adj.get(3).add(2); + + assertEquals(0, Acyclicity.acyclic(adj)); + } +} \ No newline at end of file -- cgit v1.2.3