ml4co-kit 0.2.2__tar.gz → 0.2.3__tar.gz

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: ml4co-kit
-Version: 0.2.2
+Version: 0.2.3
 Summary: ml4co-kit provides convenient dataset generators for the combinatorial optimization problem
 Home-page: https://github.com/Thinklab-SJTU/ML4CO-Kit
 Author: SJTU-ReThinkLab

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit/__init__.py

@@ -87,5 +87,5 @@ if found_pytorch_lightning is not None:
     from .learning.utils import points_to_distmat, sparse_points
 
 
-__version__ = "0.2.2"
+__version__ = "0.2.3"
 __author__ = "SJTU-ReThinkLab"

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit/utils/graph/base.py

@@ -176,6 +176,9 @@ class GraphData(object):
         Args:
             loop_weight (int, float): The weight to assign to each self-loop edge.
         """
+        if np.array([0, 0]) in self.edge_index.T:
+            return
+        
         if self.nodes_num is None:
             raise ValueError("`nodes_num` must be defined to add self-loops.")
 

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit/utils/graph/mcl.py

@@ -80,7 +80,7 @@ class MClGraphData(GraphData):
                         "``MClSolver``like ``KaMIS`` to get the ``ref_sel_nodes_num``."
                     )
                 self.ref_sel_nodes_num = np.sum(self.ref_nodes_label)
-            gap = - (self.sel_nodes_num - self.ref_sel_nodes_num) / self.ref_sel_nodes_num
+            gap = - (self.sel_nodes_num - self.ref_sel_nodes_num) / self.ref_sel_nodes_num * 100
             return (self.sel_nodes_num, self.ref_sel_nodes_num, gap)
         else:
             return self.sel_nodes_num

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit/utils/graph/mcut.py

@@ -102,7 +102,7 @@ class MCutGraphData(GraphData):
                     for j in set_B:
                         if adj_matrix[i, j] == 1:
                             self.ref_cut_edge_num += 1
-            gap = - (self.cut_edge_num - self.ref_cut_edge_num) / self.ref_cut_edge_num
+            gap = - (self.cut_edge_num - self.ref_cut_edge_num) / self.ref_cut_edge_num * 100
             return (self.cut_edge_num, self.ref_cut_edge_num, gap)
         else:
             return self.cut_edge_num

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit/utils/graph/mis.py

@@ -80,7 +80,7 @@ class MISGraphData(GraphData):
                         "``MISSolver``like ``KaMIS`` to get the ``ref_sel_nodes_num``."
                     )
                 self.ref_sel_nodes_num = np.sum(self.ref_nodes_label)
-            gap = - (self.sel_nodes_num - self.ref_sel_nodes_num) / self.ref_sel_nodes_num
+            gap = - (self.sel_nodes_num - self.ref_sel_nodes_num) / self.ref_sel_nodes_num * 100
             return (self.sel_nodes_num, self.ref_sel_nodes_num, gap)
         else:
             return self.sel_nodes_num

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit/utils/graph/mvc.py

@@ -80,7 +80,7 @@ class MVCGraphData(GraphData):
                         "``MVCSolver``like ``KaMIS`` to get the ``ref_sel_nodes_num``."
                     )
                 self.ref_sel_nodes_num = np.sum(self.ref_nodes_label)
-            gap = (self.sel_nodes_num - self.ref_sel_nodes_num) / self.ref_sel_nodes_num
+            gap = (self.sel_nodes_num - self.ref_sel_nodes_num) / self.ref_sel_nodes_num * 100
             return (self.sel_nodes_num, self.ref_sel_nodes_num, gap)
         else:
             return self.sel_nodes_num

{ml4co-kit-0.2.2 → ml4co-kit-0.2.3}/ml4co_kit.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: ml4co-kit
-Version: 0.2.2
+Version: 0.2.3
 Summary: ml4co-kit provides convenient dataset generators for the combinatorial optimization problem
 Home-page: https://github.com/Thinklab-SJTU/ML4CO-Kit
 Author: SJTU-ReThinkLab