Dependency graph of benchmarks using dependencies/provides
val is_empty : t -> booltype providers_map = Solver.Solved.t list Free_variable.Map.tWhich benchmarks provide each variable
val is_ambiguous : providers_map -> boolval warn_ambiguities : providers_map -> unitPrint out the ambiguity information to stderr
val build : Solver.Solved.t list -> resultBuild dependency graphs
val fold : (Solver.Solved.t -> 'a -> 'a) -> t -> 'a -> 'aDependency topological folding
val iter : (Solver.Solved.t -> unit) -> t -> unitDependency topological iteration
val to_sorted_list : t -> Solver.Solved.t listReturns the topological ordered list of Solver.Sovled.t
val save_graphviz : t -> string -> unitVisualize the graph using Graphviz