QuantumGraphSkeleton

class lsst.pipe.base.quantum_graph_skeleton.QuantumGraphSkeleton(task_labels: Iterable[str])

Bases: object

An under-construction quantum graph.

QuantumGraphSkeleton is intended for use inside QuantumGraphBuilder and its subclasses.

Parameters:

task_labelsIterable [ str ]

The labels of all tasks whose quanta may be included in the graph, in topological order.

Notes

QuantumGraphSkeleton models a bipartite version of the quantum graph, in which both quanta and datasets are represented as nodes and each type of node only has edges to the other type.

Square-bracket (getitem) indexing returns a mutable mapping of a node’s flexible attributes.

The details of the QuantumGraphSkeleton API (e.g. which operations operate on multiple nodes vs. a single node) are set by what’s actually needed by current quantum graph generation algorithms. New variants can be added as needed, but adding all operations that might be useful for some future algorithm seems premature.

Attributes Summary

global_init_outputs	The set of dataset nodes that are not associated with any task.
n_edges	The total number of edges.
n_nodes	The total number of nodes of all types.

Methods Summary

add_dataset_node(parent_dataset_type_name, ...)	Add a new node representing a dataset.
add_input_edge(task_key, dataset_key[, ...])	Add an edge connecting a dataset to a quantum that consumes it.
add_input_edges(task_key, dataset_keys)	Add edges connecting datasets to a quantum that consumes them.
add_output_edge(task_key, dataset_key)	Add an edge connecting a dataset to the quantum that produces it.
add_prerequisite_node(...)	Add a new node representing a prerequisite input dataset.
add_quantum_node(task_label, data_id, **attrs)	Add a new node representing a quantum.
extract_overall_inputs()	Find overall input datasets.
get_quanta(task_label)	Return the quanta for the given task label.
get_task_init_node(task_label)	Return the graph node that represents a task's initialization.
has_task(task_label)	Test whether the given task is in this skeleton.
iter_all_quanta()	Iterate over all quanta from any task, in topological (but otherwise unspecified) order.
iter_inputs_of(quantum_key)	Iterate over the datasets consumed by the given quantum.
iter_outputs_of(quantum_key)	Iterate over the datasets produced by the given quantum.
remove_dataset_nodes(keys)	Remove nodes representing datasets.
remove_input_edges(task_key, dataset_keys)	Remove edges connecting datasets to a quantum that consumes them.
remove_orphan_datasets()	Remove any dataset nodes that do not have any edges.
remove_quantum_node(key, remove_outputs)	Remove a node representing a quantum.
remove_task(task_label)	Fully remove a task from the skeleton.
update(other)	Copy all nodes from other to self.

Attributes Documentation

global_init_outputs

The set of dataset nodes that are not associated with any task.

n_edges

The total number of edges.

n_nodes

The total number of nodes of all types.

Methods Documentation

add_dataset_node(parent_dataset_type_name: str, data_id: DataCoordinate, is_global_init_output: bool = False, **attrs: Any) → DatasetKey

Add a new node representing a dataset.

add_input_edge(task_key: QuantumKey | TaskInitKey, dataset_key: DatasetKey | PrerequisiteDatasetKey, ignore_unrecognized_quanta: bool = False) → bool

Add an edge connecting a dataset to a quantum that consumes it.

Parameters:

task_keyQuantumKey or TaskInitKey

Identifier for the quantum node.

dataset_keyDatasetKey or PrerequisiteKey

Identifier for the dataset node.

ignore_unrecognized_quantabool, optional

If False, do nothing if the quantum node is not already present. If True, the quantum node is assumed to be present.

Returns:

addedbool

True if an edge was actually added, False if the quantum was not recognized and the edge was not added as a result.

Notes

Dataset nodes that are not already present will be created.

add_input_edges(task_key: QuantumKey | TaskInitKey, dataset_keys: Iterable[DatasetKey | PrerequisiteDatasetKey]) → None

Add edges connecting datasets to a quantum that consumes them.

Notes

This must only be called if the task node has already been added. Use add_input_edge if this cannot be assumed.

Dataset nodes that are not already present will be created.

add_output_edge(task_key: QuantumKey | TaskInitKey, dataset_key: DatasetKey) → None

Add an edge connecting a dataset to the quantum that produces it.

Parameters:

task_keyQuantumKey or TaskInitKey

Identifier for the quantum node. Must identify a node already present in the graph.

dataset_keyDatasetKey

Identifier for the dataset node. Must identify a node already present in the graph.

add_prerequisite_node(parent_dataset_type_name: str, ref: DatasetRef, **attrs: Any) → PrerequisiteDatasetKey

Add a new node representing a prerequisite input dataset.

add_quantum_node(task_label: str, data_id: DataCoordinate, **attrs: Any) → QuantumKey

Add a new node representing a quantum.

extract_overall_inputs() → dict[lsst.pipe.base.quantum_graph_skeleton.DatasetKey | lsst.pipe.base.quantum_graph_skeleton.PrerequisiteDatasetKey, lsst.daf.butler._dataset_ref.DatasetRef]

Find overall input datasets.

Returns:

datasetsdict [ DatasetKey or PrerequisiteDatasetKey, DatasetRef ]

Overall-input datasets, including prerequisites and init-inputs.

get_quanta(task_label: str) → Set[QuantumKey]

Return the quanta for the given task label.

Parameters:

task_labelstr

Label for the task.

Returns:

quantaSet [ QuantumKey ]

A set-like object with the identifiers of all quanta for the given task. The skeleton object’s set of quanta must not be modified while iterating over this container; make a copy if mutation during iteration is necessary.

get_task_init_node(task_label: str) → TaskInitKey

Return the graph node that represents a task’s initialization.

has_task(task_label: str) → bool

Test whether the given task is in this skeleton.

Tasks are only added to the skeleton at initialization, but may be removed by remove_task if they end up having no quanta.

iter_all_quanta() → Iterator[QuantumKey]

Iterate over all quanta from any task, in topological (but otherwise unspecified) order.

iter_inputs_of(quantum_key: QuantumKey | TaskInitKey) → Iterator[DatasetKey | PrerequisiteDatasetKey]

Iterate over the datasets consumed by the given quantum.

iter_outputs_of(quantum_key: QuantumKey | TaskInitKey) → Iterator[DatasetKey]

Iterate over the datasets produced by the given quantum.

remove_dataset_nodes(keys: Iterable[DatasetKey | PrerequisiteDatasetKey]) → None

Remove nodes representing datasets.

remove_input_edges(task_key: QuantumKey | TaskInitKey, dataset_keys: Iterable[DatasetKey | PrerequisiteDatasetKey]) → None

Remove edges connecting datasets to a quantum that consumes them.

remove_orphan_datasets() → None

Remove any dataset nodes that do not have any edges.

remove_quantum_node(key: QuantumKey, remove_outputs: bool) → None

Remove a node representing a quantum.

Parameters:

keyQuantumKey

Identifier for the node.

remove_outputsbool

If True, also remove all dataset nodes produced by this quantum. If False, any such dataset nodes will become overall inputs.

remove_task(task_label: str) → None

Fully remove a task from the skeleton.

All init-output datasets and quanta for the task must already have been removed.

update(other: QuantumGraphSkeleton) → None

Copy all nodes from other to self.

The tasks in other must be a subset of the tasks in self (this method is expected to be used to populate a skeleton for a full from independent-subgraph skeletons).