Skip to content

Commit

Permalink
Match function name to most recent minorminer version
Browse files Browse the repository at this point in the history
  • Loading branch information
Andy Zhang committed Dec 20, 2024
1 parent 3e435cc commit 35c8061
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
4 changes: 2 additions & 2 deletions tutorial_code/embed_loops.py
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@
)

from minorminer.utils.feasibility import (
lattice_size_upper_bound,
lattice_size,
lattice_size_lower_bound,
)

Expand Down Expand Up @@ -77,7 +77,7 @@ def embed_loops(

sublattice_size = kwargs.pop(
"sublattice_size",
min(lattice_size_lower_bound(S=G, T=A) + 1, lattice_size_upper_bound(T=A)),
min(lattice_size_lower_bound(S=G, T=A) + 1, lattice_size(T=A)),
)

if not isinstance(sublattice_size, int) or sublattice_size <= 0:
Expand Down
4 changes: 2 additions & 2 deletions tutorial_code/embed_square_lattice.py
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@

from minorminer.utils.feasibility import (
embedding_feasibility_filter,
lattice_size_upper_bound,
lattice_size,
lattice_size_lower_bound,
)

Expand Down Expand Up @@ -90,7 +90,7 @@ def embed_square_lattice(
raise ValueError(f"Embedding {G} on {A} is infeasible")
sublattice_size = kwargs.pop(
"sublattice_size",
min(lattice_size_lower_bound(S=G, T=A) + 1, lattice_size_upper_bound(T=A)),
min(lattice_size_lower_bound(S=G, T=A) + 1, lattice_size(T=A)),
)
if not isinstance(sublattice_size, int) or sublattice_size <= 0:
raise ValueError(
Expand Down

0 comments on commit 35c8061

Please sign in to comment.