cirq.is_valid_placement

Return whether the given placement is a valid placement of small_graph onto big_graph.

cirq.is_valid_placement(
    big_graph: nx.Graph, small_graph: nx.Graph, small_to_big_mapping: Dict
)

Used in the tutorials
Qubit Placement

This is done by making sure all the nodes and edges on the mapped version of small_graph are present in big_graph.

Args
`big_graph`	A larger graph we're placing `small_graph` onto.
`small_graph`	A smaller, (potential) sub-graph to validate the given mapping.
`small_to_big_mapping`	A mapping from `small_graph` nodes to `big_graph` nodes. After the mapping occurs, we check whether all of the mapped nodes and edges exist on `big_graph`.

Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.

Last updated 2025-04-15 UTC.

Args