Skip to content

Commit

Permalink
mapper->mappers
Browse files Browse the repository at this point in the history
  • Loading branch information
atravitz committed Nov 8, 2024
1 parent 0ad0d9c commit 6952fe7
Showing 1 changed file with 8 additions and 8 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ class CyclicConcatenator(NetworkConcatenator):
def __init__(
self,
# TODO: should this be "mappers" for API consistency, or is it only one mapper by design?
mapper: AtomMapper,
mappers: Union[AtomMapper, Iterable[AtomMapper]],
scorer: AtomMappingScorer,
n_connecting_cycles: int = 2,
cycle_sizes: Union[int, list[int]] = 3,
Expand All @@ -33,12 +33,12 @@ def __init__(
Parameters
----------
mapper: AtomMapper
the atom mapper is required, to define the connection
between two ligands.
mappers: AtomMapper
The AtomMapper(s) to use to propose mappings. At least 1 required,
but many can be given, in which case all will be tried to find the
lowest score edges
scorer: AtomMappingScorer
scoring function evaluating an atom mapping, and giving a
score between [0,1].
Any callable which takes a AtomMapping and returns a float between [0,1]
n_connecting_cycles: int, optional
build at least n cycles between th networks. (default: 2)
cycle_sizes: Union[int, list[int]], optional
Expand All @@ -50,11 +50,11 @@ def __init__(
"""
if _initial_edge_lister is None:
_initial_edge_lister = MaxConcatenator(
mappers=mapper, scorer=scorer, n_processes=n_processes
mappers=mappers, scorer=scorer, n_processes=n_processes
)

super().__init__(
mappers=mapper,
mappers=mappers,
scorer=scorer,
network_generator=MstNetworkAlgorithm(),
n_processes=n_processes,
Expand Down

0 comments on commit 6952fe7

Please sign in to comment.