alonso 0.0.8__py3-none-any.whl → 0.0.9__py3-none-any.whl

alonso/app.py

@@ -82,7 +82,7 @@ def main():
     helper.add_argument('-c', '--count', action='store_true', help='calculate the size of the vertex cover')
     helper.add_argument('-v', '--verbose', action='store_true', help='anable verbose output')
     helper.add_argument('-l', '--log', action='store_true', help='enable file logging')
-    helper.add_argument('--version', action='version', version='%(prog)s 0.0.8')
+    helper.add_argument('--version', action='version', version='%(prog)s 0.0.9')
     
     # Initialize the parameters
     args = helper.parse_args()

alonso/batch.py

@@ -36,7 +36,7 @@ def main():
     helper.add_argument('-c', '--count', action='store_true', help='calculate the size of the vertex cover')
     helper.add_argument('-v', '--verbose', action='store_true', help='anable verbose output')
     helper.add_argument('-l', '--log', action='store_true', help='enable file logging')
-    helper.add_argument('--version', action='version', version='%(prog)s 0.0.8')
+    helper.add_argument('--version', action='version', version='%(prog)s 0.0.9')
 
     
     # Initialize the parameters

alonso/partition.py

@@ -1,7 +1,8 @@
 from collections import defaultdict
 import networkx as nx
 from typing import Set, Tuple, List
-import mendive.algorithm as algo
+import mendive.algorithm as claws
+import aegypti.algorithm as triangles
 class ClawFreePartitioner:
     """
     Implements a polynomial-time algorithm to partition graph edges into two sets
@@ -57,32 +58,23 @@ class ClawFreePartitioner:
             True if adding the edge would create a claw, False otherwise
         """
         # Build adjacency list for current partition
-        adj = defaultdict(set)
+        G = nx.Graph()
         for u, v in edges_in_partition:
-            adj[u].add(v)
-            adj[v].add(u)
+            G.add_edge(u, v)
         
         # Add the new edge temporarily
         u, v = new_edge
-        adj[u].add(v)
-        adj[v].add(u)
-        
+        G.add_edge(u, v)
+        H = nx.complement(G)
         # Check if any vertex now forms a claw
         for vertex in [u, v]:
-            neighbors = list(adj[vertex])
+            neighbors = list(G.neighbors(vertex))
             if len(neighbors) >= 3:
                 # Check all combinations of 3 neighbors
-                
-                for i in range(len(neighbors)):
-                    for j in range(i + 1, len(neighbors)):
-                        for k in range(j + 1, len(neighbors)):
-                            n1, n2, n3 = neighbors[i], neighbors[j], neighbors[k]
-                            # Check if these 3 neighbors are not connected to each other
-                            # (which would make vertex the center of a claw)
-                            if (n1 not in adj[n2] and n2 not in adj[n1] and
-                                n1 not in adj[n3] and n3 not in adj[n1] and
-                                n2 not in adj[n3] and n3 not in adj[n2]):
-                                return True
+                subgraph = H.subgraph(neighbors)
+                triangle = triangles.find_triangle_coordinates(subgraph, first_triangle=True)
+                if triangle is not None:
+                    return True
         
         return False
     
@@ -162,7 +154,7 @@ class ClawFreePartitioner:
         # Build adjacency list
         G = nx.Graph()
         G.add_edges_from(edge_set)
-        claw = algo.find_claw_coordinates(G, first_claw=True)
+        claw = claws.find_claw_coordinates(G, first_claw=True)
         if claw is None:
             return True
         else: 

alonso/test.py

@@ -34,7 +34,7 @@ def main():
     helper.add_argument('-w', '--write', action='store_true', help='write the generated random matrix to a file in the current directory')
     helper.add_argument('-v', '--verbose', action='store_true', help='anable verbose output')
     helper.add_argument('-l', '--log', action='store_true', help='enable file logging')
-    helper.add_argument('--version', action='version', version='%(prog)s 0.0.8')
+    helper.add_argument('--version', action='version', version='%(prog)s 0.0.9')
     
     # Initialize the parameters
     args = helper.parse_args()

{alonso-0.0.8.dist-info → alonso-0.0.9.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: alonso
-Version: 0.0.8
+Version: 0.0.9
 Summary: Compute an Approximate Vertex Cover for undirected graph encoded in DIMACS format.
 Home-page: https://github.com/frankvegadelgado/alonso
 Author: Frank Vega

alonso-0.0.9.dist-info/RECORD

@@ -0,0 +1,17 @@
+alonso/__init__.py,sha256=xFbWJ7kskxYZCWD3QWtJ6d9uGnDlqhJyFJDCVuqG7hE,207
+alonso/algorithm.py,sha256=QqSdBTIPtLxAVoCtCmlTTlflJafjsbA00AKMRehKoOE,5241
+alonso/app.py,sha256=isJf8tfBBqVaIdLBAlVH-msDssouUvvCI-g-lZrrHwM,4320
+alonso/applogger.py,sha256=fQBo51-TboX1DBqfSxX2P2eKJ5CcyiCq_IVlJTHjxAE,2624
+alonso/batch.py,sha256=dLXmdjCRN3wRndHwnKlYzAHgIHlpRjcL_-68wTX8cKM,2305
+alonso/merge.py,sha256=dWhF9t_2bFp4HT1NCzjhrSlhm8CkJQ4pwBHOhHSkezQ,4257
+alonso/parser.py,sha256=Ib4TnWdkQb6A6FA3HHEjZDBb7uD0v9Gabwewqfu4XpQ,2549
+alonso/partition.py,sha256=i6Q4rKN6ftETncaEyUVXJCIdRaNpGacrDmdd8iQETO4,7643
+alonso/stable.py,sha256=IwINwjd3F7dfoISXlWsNWRkVJzItEojgMyNwzMM7nYc,6577
+alonso/test.py,sha256=8zXNhb2yT-lxNYkdd3SB2YYOEqReQXo_gd05d4L88QA,5472
+alonso/utils.py,sha256=RmctLB8oDtjf0wKcKFaRvXiRgmtegqfbB1HFFzlpsvE,7674
+alonso-0.0.9.dist-info/licenses/LICENSE,sha256=nUDh1nfa7rfEv1HocpoqPu0JaFnZKpIVh9eM0MgozpM,1067
+alonso-0.0.9.dist-info/METADATA,sha256=dD3thlXmh7yvGqBa-0icie9y1g3z9d0Ra39vcJi6O5g,9293
+alonso-0.0.9.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+alonso-0.0.9.dist-info/entry_points.txt,sha256=JSod2CWtklhiaOFW3masqrgqhXIpVRsbIiprSmS1P7g,98
+alonso-0.0.9.dist-info/top_level.txt,sha256=rOo7SlpYGdic6g55rHDus2d5N2t74H9qamX4yi6z5vw,7
+alonso-0.0.9.dist-info/RECORD,,

alonso-0.0.8.dist-info/RECORD

@@ -1,17 +0,0 @@
-alonso/__init__.py,sha256=xFbWJ7kskxYZCWD3QWtJ6d9uGnDlqhJyFJDCVuqG7hE,207
-alonso/algorithm.py,sha256=QqSdBTIPtLxAVoCtCmlTTlflJafjsbA00AKMRehKoOE,5241
-alonso/app.py,sha256=W4lRbazSIy5zqNZUZmEgQ-7qGlQnczw2AwV6_6EDlcA,4320
-alonso/applogger.py,sha256=fQBo51-TboX1DBqfSxX2P2eKJ5CcyiCq_IVlJTHjxAE,2624
-alonso/batch.py,sha256=6Q9m_H_zj-eiG_qd7As856C--pzBFckpX8_N3zLT7qc,2305
-alonso/merge.py,sha256=dWhF9t_2bFp4HT1NCzjhrSlhm8CkJQ4pwBHOhHSkezQ,4257
-alonso/parser.py,sha256=Ib4TnWdkQb6A6FA3HHEjZDBb7uD0v9Gabwewqfu4XpQ,2549
-alonso/partition.py,sha256=iDtuIkLyBTf8Cg-nceYDgLlWWQ2mLGrm-J3fmnz0j5I,8114
-alonso/stable.py,sha256=IwINwjd3F7dfoISXlWsNWRkVJzItEojgMyNwzMM7nYc,6577
-alonso/test.py,sha256=f-L8SlJfRlnbu9_EV-8m8b7X9eobBxH3VX2JN9eU0U8,5472
-alonso/utils.py,sha256=RmctLB8oDtjf0wKcKFaRvXiRgmtegqfbB1HFFzlpsvE,7674
-alonso-0.0.8.dist-info/licenses/LICENSE,sha256=nUDh1nfa7rfEv1HocpoqPu0JaFnZKpIVh9eM0MgozpM,1067
-alonso-0.0.8.dist-info/METADATA,sha256=LdX28VgfNlpHcpkq4Y1xM4UuRCv7jTwX2hN1ca4FEos,9293
-alonso-0.0.8.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-alonso-0.0.8.dist-info/entry_points.txt,sha256=JSod2CWtklhiaOFW3masqrgqhXIpVRsbIiprSmS1P7g,98
-alonso-0.0.8.dist-info/top_level.txt,sha256=rOo7SlpYGdic6g55rHDus2d5N2t74H9qamX4yi6z5vw,7
-alonso-0.0.8.dist-info/RECORD,,