Skip to content

Commit

Permalink
Fix pre-commit failure
Browse files Browse the repository at this point in the history
  • Loading branch information
[email protected] committed Oct 22, 2024
1 parent 0f8659c commit d03ce19
Showing 1 changed file with 3 additions and 2 deletions.
5 changes: 3 additions & 2 deletions hypernetx/algorithms/matching_algorithms.py
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down Expand Up @@ -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
Expand Down

0 comments on commit d03ce19

Please sign in to comment.