PRUNING COMPILATION DEPENDENCY GRAPHS

Technologies are disclosed for pruning a dependency graph representing source artifacts compilable by a plurality of compilers. The dependency graph can include strongly connected components represented as a directed acyclic graph. During compilation of the source artifacts, it can be discovered that some source artifacts did not need to be compiled, and associated nodes in the dependency graph can be pruned. Pruning can result in removal of nodes for source artifacts that are yet to be compiled, and compilation for source artifacts associated with such nodes in the dependency graph can be avoided.