Function TestDirectedGraph

data-structures/graph/graph_test.go:104–145

(t *testing.T)

}

func TestDirectedGraph(t *testing.T) {
	g := NewDirected()

	for i := 0; i < 10; i++ {
		g.AddVertex(VertexId(i))
	}

	if len(g.edges) != 10 {
		fmt.Println(g)
		t.Error()
	}

	for i := 0; i < 10; i++ {
		g.AddEdge(VertexId(i), VertexId(i%2), 1)
	}

	r := g.Reverse()
	if !r.IsEdge(1, 7) || r.IsEdge(8, 0) {
		fmt.Println(r.edges)
		t.Error()
	}

	successors := r.GetSuccessors(1).VerticesIter()
	for successor := range successors {
		if successor != 3 &&
			successor != 5 &&
			successor != 7 &&
			successor != 9 {
			t.Error()
		}
	}

	predecessors := g.GetPredecessors(1).VerticesIter()
	for predecessor := range predecessors {
		if predecessor != 3 &&
			predecessor != 5 &&
			predecessor != 7 &&
			predecessor != 9 {
			t.Error()
		}
	}
}