Finished partitioning algorithm:

-  Added initial guess for the function order within a partition
-  Added option to calculate a pareto front for different number of partitions
-  Made some changes to improve the speed of the algorithm
-  Small bug fix for adding local convergers to the diagonal order in the MPG
-  Small bug fix in partition load imbalance factor
-  Code cleanup and updated docstrings


Former-commit-id: 2b240860df45a24b37f449442d1103ed3414f605

kadmos/graph/graph_process.py

@@ -392,8 +392,8 @@ class MdaoProcessGraph(ProcessGraph):
                 convs = self.find_all_nodes(
                     attr_cond=['architecture_role', '==', self.ARCHITECTURE_ROLES_FUNS[2]])  # converger
                 if len(convs) >= 1:
-                    sys_conv = [item for item in convs if
-                                self.SUBSYS_SUFFIX in item and self.SUBSYS_SUFFIX + str(idx) in item]
+                    sys_conv = [item for item in convs if self.SUBSYS_PREFIX + self.CONVERGER_STRING +
+                                self.SUBSYS_SUFFIX + str(idx) == item]
                     assert len(sys_conv) <= 1, '{} subsystem convergers found, max one expected'.format(len(sys_conv))
                     convs = sys_conv
                     diagonal_order.extend(convs)  # converger