make partitioning algorithm return a new partition count; let hierarchical clustering choose the best partitioning result that does not exceed the given partitioning count
improve critical path calculation in partitioning graph by adding a scheduling option for critical path of software partitions (currently the default option)
implement hungry greedy algorithm for graph partitioning (Kernighan-Lin) -> will optimize it next
optimize Kernighan-Lin partitioning algorithm
implement random balanced bi-partitioning and use it as a starting point for Kernighan-Lin
set Kernighan-Lin as current default partitioning method in llvm build script