assertTrue(hasEdge(graph5, "a", "b"));
        assertTrue(hasEdge(graph5, "b", "c"));
        assertTrue(hasEdge(graph5, "b", "f"));
        assertTrue(hasEdge(graph5, "f", "g"));
        assertTrue(hasEdge(graph5, "g", "h"));
        assertTrue(hasEdge(graph5, "c", "d"));
        assertTrue(hasEdge(graph5, "d", "e"));
        assertFalse(hasEdge(graph5, "e", "b"));
    }

    @Test

			}
		}
	}

	// 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