From d03ce197094de0acd721d687cd34b0de2a5c8326 Mon Sep 17 00:00:00 2001 From: "ryan.danehy@pnnl.gov" Date: Tue, 22 Oct 2024 15:37:09 -0700 Subject: [PATCH] Fix pre-commit failure --- hypernetx/algorithms/matching_algorithms.py | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/hypernetx/algorithms/matching_algorithms.py b/hypernetx/algorithms/matching_algorithms.py index bf80b978..ef13e8df 100644 --- a/hypernetx/algorithms/matching_algorithms.py +++ b/hypernetx/algorithms/matching_algorithms.py @@ -13,6 +13,7 @@ import random from concurrent.futures import ThreadPoolExecutor + def approximation_matching_checking(optimal: list, approx: list) -> bool: """ Checks if the approximate list contains at least one element that is a subset of each element in the optimal list. @@ -494,8 +495,8 @@ def HEDCS_matching(hypergraph: Hypergraph, s: int) -> list: """ HEDCS-Matching for Approximate Hypergraph Matching. - This algorithm constructs Hyper-Edge Degree Constrained Subgraphs (HEDCS) - to find an approximate maximal matching in a d-uniform hypergraph. It leverages + This algorithm constructs Hyper-Edge Degree Constrained Subgraphs (HEDCS) + to find an approximate maximal matching in a d-uniform hypergraph. It leverages parallelization to efficiently handle larger hypergraphs. Parameters