lint

Author: korthaj

example_dfs_test.go

@@ -14,7 +14,7 @@ const (
 // The package doesn't support vertex labeling. However,
 // since vertices are always numbered 0..n-1, it's easy
 // to add this type of data on the side. This implementation
-// of depth-first search uses seperate slices to keep track of
+// of depth-first search uses separate slices to keep track of
 // vertex colors, predecessors and discovery times.
 type DFSData struct {
 	Time     int

strong_test.go

@@ -26,7 +26,7 @@ func TestStrongComponents(t *testing.T) {
 	g.Add(7, 6)
 	g.Add(7, 7)
 	g.Add(8, 8)
-	exp := [][]int{[]int{2, 1, 0}, []int{6, 4}, []int{5, 3}, []int{7}, []int{8}, []int{9}}
+	exp := [][]int{{2, 1, 0}, {6, 4}, {5, 3}, {7}, {8}, {9}}
 	if mess, diff := diff(StrongComponents(g), exp); diff {
 		t.Errorf("StronglyConnected %s", mess)
 	}

weak_test.go

@@ -14,15 +14,15 @@ func TestComponents(t *testing.T) {
 	}
 
 	g = New(1)
-	if mess, diff := diff(Components(g), [][]int{[]int{0}}); diff {
+	if mess, diff := diff(Components(g), [][]int{{0}}); diff {
 		t.Errorf("Components %s", mess)
 	}
 	if mess, diff := diff(Connected(g), true); diff {
 		t.Errorf("Connected %s", mess)
 	}
 
 	g.Add(0, 0)
-	if mess, diff := diff(Components(g), [][]int{[]int{0}}); diff {
+	if mess, diff := diff(Components(g), [][]int{{0}}); diff {
 		t.Errorf("Components %s", mess)
 	}
 	if mess, diff := diff(Connected(g), true); diff {
@@ -32,7 +32,7 @@ func TestComponents(t *testing.T) {
 	g = New(4)
 	g.Add(0, 1)
 	g.Add(2, 1)
-	if mess, diff := diff(Components(g), [][]int{[]int{0, 1, 2}, []int{3}}); diff {
+	if mess, diff := diff(Components(g), [][]int{{0, 1, 2}, {3}}); diff {
 		t.Errorf("Components %s", mess)
 	}
 	if mess, diff := diff(Connected(g), false); diff {
@@ -43,7 +43,7 @@ func TestComponents(t *testing.T) {
 	g.AddBoth(1, 2)
 	g.AddBoth(2, 3)
 	g.AddBoth(0, 3)
-	if mess, diff := diff(Components(g), [][]int{[]int{0, 1, 2, 3}}); diff {
+	if mess, diff := diff(Components(g), [][]int{{0, 1, 2, 3}}); diff {
 		t.Errorf("Components %s", mess)
 	}
 	if mess, diff := diff(Connected(g), true); diff {