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

func (g *Graph) TransitiveReduction() {
	// For i -> j -> k, if i -> k exists, delete it.
	for _, i := range g.Nodes {
		for _, j := range g.Nodes {
			if g.HasEdge(i, j) {
				for _, k := range g.Nodes {
					if g.HasEdge(j, k) {
						g.DelEdge(i, k)
					}
				}
			}
		}
	}

			}
		}
	}

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

	wantEdges := strings.Fields(edges)
	wantEdgeMap := make(map[string]bool)
	for _, e := range wantEdges {
		wantEdgeMap[e] = true
	}

	for _, n1 := range g.Nodes {
		for _, n2 := range g.Nodes {
			got := g.HasEdge(n1, n2)
			want := wantEdgeMap[n1+"->"+n2]
			if got && want {
				t.Logf("%s->%s", n1, n2)
			} else if got && !want {
				t.Errorf("%s->%s present but not expected", n1, n2)
			} else if want && !got {