}
		}
	}

	// Complete transitive closure.
	for _, k := range g.Nodes {
		for _, i := range g.Nodes {
			for _, j := range g.Nodes {
				if i != k && k != j && g.HasEdge(i, k) && g.HasEdge(k, j) {
					if i == j {
						// Can only happen along with a "use of X before deps" error above,
						// but this error is more specific - it makes clear that reordering the

			t.Error(err)
			continue
		}
		if sawImport[pkg] == nil {
			sawImport[pkg] = map[string]bool{}
		}
		var bad []string
		for _, imp := range imports {
			sawImport[pkg][imp] = true
			if !policy.HasEdge(pkg, imp) {
				bad = append(bad, imp)
			}
		}
		if bad != nil {
			t.Errorf("unexpected dependency: %s imports %v", pkg, bad)
		}
	}
}

var buildIgnore = []byte("\n//go:build ignore")

addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List getChildLabels(String); public java.util.List getParentLabels(String); public Object clone() throws CloneNotSupportedExc; public boolean isConnected(String); public java.util.List getSuccessorLabels(String);...