mqt.ionshuttler.multi_shuttler.outside.cycles

Module Contents

get_ions_in_pz_and_connections(graph: Graph, pz: ProcessingZone) → int

get_ions_in_exit_connections(graph: Graph, pz: ProcessingZone) → int

get_ions_in_parking(graph: Graph, pz: ProcessingZone) → int

find_ion_in_edge(graph: Graph, edge_idc: Edge) → int | None

find_ions_in_parking(graph: Graph, pz: ProcessingZone) → list[int]

get_state_idxs(graph: Graph) → dict[int, int]

find_least_import_ion_in_parking(seq: list[int], ions_in_parking: list[int]) → int

create_starting_config(graph: Graph, n_of_ions: int, seed: int | None = None) → int

get_ions(graph: Graph) → dict[int, Edge]

get_edge_state(graph: Graph) → dict[Edge, list[int]]

have_common_junction_node(graph: Graph, edge1: Edge, edge2: Edge) → bool

check_if_edge_is_filled(graph: Graph, edge_idc: Edge) → bool

PENALTY = 100000000

edge_weight_factory(exclude_exit: bool, exclude_first_entry_connection: bool) → Callable[[Node, Node, dict[str, Any]], float]

precompute_all_paths(nx_g: Graph) → dict[tuple[bool, bool], dict[Node, dict[Node, list[Node]]]]

shortest_path_to_node(nx_g: Graph, src: Node, tar: Node, exclude_exit: bool = False, exclude_first_entry_connection: bool = True) → list[Node] | None

shortest_path_to_node_no_cache(nx_g: Graph, src: Node, tar: Node, exclude_exit: bool = False, exclude_first_entry_connection: bool = True) → list[Node]

find_path_node_to_edge(graph: Graph, node: Node, goal_edge: Edge, exclude_exit: bool = False, exclude_first_entry_connection: bool = True) → list[Node] | None

find_path_edge_to_edge(graph: Graph, edge_idc: Edge, goal_edge: Edge, exclude_exit: bool = False, exclude_first_entry_connection: bool = True, find_any_path: bool = False) → list[Node] | None

find_next_edge(graph: Graph, edge_idc: Edge, goal_edge: Edge, exclude_exit: bool = False, exclude_first_entry_connection: bool = True) → Edge

find_ordered_edges(graph: Graph, edge1: Edge, edge2: Edge) → tuple[Edge, Edge]

create_cycle(graph: Graph, edge_idc: Edge, next_edge: Edge) → list[Edge] | None

find_conflict_cycle_idxs(graph: Graph, cycles_dict: dict[int, list[Edge]]) → list[tuple[int, int]]