SemigraphSolver

Combined Garbage Collector, Conflict Resolver and Mutation Resolver

Traces the graph from the roots, solves the conflicts just in time by applying the axis rules, and orders mutators in sane and predictable order.

"predecessor" stands for "a node which should be processed before its successor".

Map of predecessors is a map where the key is a dependent and the value is a set of all its direct dependencies