Descendants

Finds every vertex reachable from a vertex, such as all the jobs that wait for one step of a build.

Time complexity O(V+E), gograph function dag.Descendants.

Course prerequisites

Fourteen courses of a computer science degree. Each edge points from a course to a course that requires it.

A directed graph with 14 vertices and 18 edges.

Which courses can a student take only after passing Data structures, directly or through other courses?

Use it in Go

jobs, err := dag.Descendants(g, "Data structures")
if err != nil {
	return err
}
for _, v := range jobs {
	fmt.Println(v.Label())
}

Example graphs

• Build pipeline, 7 vertices and 9 edges
• Course prerequisites, 14 vertices and 18 edges
• Spreadsheet formulas, 25 vertices and 41 edges
• Go module graph, 62 vertices and 116 edges
• Monorepo build, 100 vertices and 266 edges

More in Dependencies

• Ancestors: Finds every vertex that can reach a vertex, such as all the courses one course needs first.
• Affected: Finds the changed vertices and every vertex reachable from them, such as all the cells a spreadsheet edit recomputes.
• Transitive reduction: Drops every edge that a longer path already implies. Each vertex still reaches the same vertices.

All algorithms