Affected
Finds the changed vertices and every vertex reachable from them, such as all the cells a spreadsheet edit recomputes.
Time complexity O(V+E), gograph function dag.Affected.
How it works
Affected takes the vertices that changed and returns them with every vertex reachable from any of them. It is one breadth-first search that starts from all the changed vertices at once, so a vertex reachable from several of them is listed once.
The changed vertices come first, in the order given, then the rest, nearest first. It costs O(V+E) for the part of the graph it reaches, however many vertices changed. Running Descendants once for each change finds the same vertices, but repeats the work wherever their descendants overlap.
Use it to decide what to rebuild, retest or redeploy after a commit, which cells a spreadsheet recomputes after an edit, or which targets a change to a shared library touches.
Course prerequisites
Fourteen courses of a computer science degree, each one semester long. Each edge points from a course to a course that requires it.
A directed graph with 14 vertices and 18 edges.
The department rewrites Computer systems and Linear algebra. Which courses may need to change too, because they build on them?
5 vertices are affected: Computer systems and Linear algebra, which changed, and Compilers, Machine learning and Operating systems.
Step by step
- Computer systems and Linear algebra changed, so they are affected. Put them in the queue.
- Take Computer systems from the queue. It has edges to Operating systems and Compilers. Both are new, so they join the queue.
- Take Linear algebra from the queue. It has an edge to Machine learning, which is new, so it joins the queue.
- Take Operating systems from the queue. It has no edges out.
- Take Compilers from the queue. It has no edges out.
- Take Machine learning from the queue. It has no edges out.
- Done. 5 vertices are affected: the 2 changed vertices and 3 more reachable from them.
Use it in Go
jobs, err := dag.Affected(g, "Computer systems", "Linear algebra")
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
- Descendants: Finds every vertex reachable from a vertex, such as all the jobs that wait for one step of a build.
- Ancestors: Finds every vertex that can reach a vertex, such as all the courses one course needs first.
- Transitive reduction: Drops every edge that a longer path already implies. Each vertex still reaches the same vertices.
- Critical path: Finds the longest chain of tasks that wait on each other, which sets how long the whole run takes however many tasks run in parallel.
- Diff: Compares two graphs and returns the vertices, edges, weights and edge labels that differ, matching vertices by label.