TheRealSamuel/LeetCodeProblem

1 2import static org.junit.jupiter.api.Assertions.*;3import org.junit.jupiter.api.Test;4import java.util.List;5import java.util.Arrays;6import java.util.ArrayList;7public class Main {8    //Program start9    10    //Program end11 12    @Test13public void test1() {14    assertEquals(new ArrayList<>(Arrays.asList(new ArrayList<>(Arrays.asList(4,1,1)),new ArrayList<>(Arrays.asList(2,0,1)),new ArrayList<>(Arrays.asList(0,3,3)),new ArrayList<>(Arrays.asList(4,3,1)))), modifiedGraphEdges(5, new ArrayList<>(Arrays.asList(new ArrayList<>(Arrays.asList(4,1,-1)),new ArrayList<>(Arrays.asList(2,0,-1)),new ArrayList<>(Arrays.asList(0,3,-1)),new ArrayList<>(Arrays.asList(4,3,-1)))), 0, 1, 5));15}16@Test17public void test2() {18    assertEquals(new ArrayList<>(), modifiedGraphEdges(3, new ArrayList<>(Arrays.asList(new ArrayList<>(Arrays.asList(0,1,-1)),new ArrayList<>(Arrays.asList(0,2,5)))), 0, 2, 6));19}20@Test21public void test3() {22    assertEquals(new ArrayList<>(Arrays.asList(new ArrayList<>(Arrays.asList(1,0,4)),new ArrayList<>(Arrays.asList(1,2,3)),new ArrayList<>(Arrays.asList(2,3,5)),new ArrayList<>(Arrays.asList(0,3,1)))), modifiedGraphEdges(4, new ArrayList<>(Arrays.asList(new ArrayList<>(Arrays.asList(1,0,4)),new ArrayList<>(Arrays.asList(1,2,3)),new ArrayList<>(Arrays.asList(2,3,5)),new ArrayList<>(Arrays.asList(0,3,-1)))), 0, 2, 6));23}24 25}26