A first rewrite of the graph partition approach for quicksched. Only tasks...

A first rewrite of the graph partition approach for quicksched. Only tasks that lock resources are considered for the resources costs, and only resources that are locked are used to compute te graph. We no longer need the edgelist_squash function as we create edgelists directly