@@ -0,0 +1,687 @@
+package com.stephenramthun.algorithms.graph;%0A%0Aimport static org.junit.jupiter.api.Assertions.assertNull;%0Aimport static org.junit.jupiter.api.Assertions.assertTrue;%0Aimport static org.junit.jupiter.api.Assertions.assertFalse;%0Aimport static org.junit.jupiter.api.Assertions.assertEquals;%0Aimport static org.junit.jupiter.api.Assertions.assertNotEquals;%0A%0Aimport org.junit.jupiter.api.Test;%0A%0Aclass TopologicalSortTest %7B%0A%0A    @Test%0A    void testTopSort() %7B%0A        int n = 10;%0A        int expectedSize = n;%0A        Integer%5B%5D values = new Integer%5Bn%5D;%0A%0A        for (int i = 0; i %3C n; i++) %7B%0A            values%5Bi%5D = i;%0A        %7D%0A%0A        Graph%3CInteger%3E graph = new Graph%3CInteger%3E(values);%0A    %7D%0A%7D%0A

Add tests for top sort.