Function buildDiamondGraph

internal/graph/graph_test.go:11–22

buildDiamondGraph creates: A→B, A→C, B→D, C→D

()

// buildDiamondGraph creates: A→B, A→C, B→D, C→D
func buildDiamondGraph() (*Graph[string, string], [4]NodeIndex) {
	g := New[string, string]()
	a := g.AddNode("A")
	b := g.AddNode("B")
	c := g.AddNode("C")
	d := g.AddNode("D")
	g.AddEdge(a, b, "ab")
	g.AddEdge(a, c, "ac")
	g.AddEdge(b, d, "bd")
	g.AddEdge(c, d, "cd")
	return g, [4]NodeIndex{a, b, c, d}
}

// buildChainGraph creates: A→B→C
func buildChainGraph() (*Graph[string, string], [3]NodeIndex) {