graph_primitives

Edge metadata and graph error definitions.

pysatl_core.distributions.registry.graph_primitives.DEFAULT_COMPUTATION_KEY: LabelName = 'PySATL_default_computation'

Default label for computation edges when no specific label is provided.

class pysatl_core.distributions.registry.graph_primitives.EdgeMeta(method, constraint=<factory>, is_analytical=False)[source]

Bases: ABC

Metadata for a computation edge in the characteristic graph.

Parameters:
  • method (EdgeMethod) – The computation method that defines the edge.

  • constraint (GraphPrimitiveConstraint) – Constraint determining when this edge is applicable to a distribution. Defaults to a pass-through constraint that always allows.

  • is_analytical (bool) – Whether this edge represents an analytical computation.

method: TypeAliasType
constraint: GraphPrimitiveConstraint
is_analytical: bool
abstract edge_kind()[source]

Return edge kind identifier.

Return type:

str

__init__(method, constraint=<factory>, is_analytical=False)
Parameters:
Return type:

None

class pysatl_core.distributions.registry.graph_primitives.ComputationEdgeMeta(method, constraint=<factory>, is_analytical=False)[source]

Bases: EdgeMeta

Edge metadata for conversion computations from the registry graph.

Parameters:
edge_kind()[source]

Return edge kind identifier.

Return type:

str

__init__(method, constraint=<factory>, is_analytical=False)
Parameters:
Return type:

None

class pysatl_core.distributions.registry.graph_primitives.AnalyticalLoopEdgeMeta(method, constraint=<factory>, is_analytical=True)[source]

Bases: EdgeMeta

Edge metadata for self-loop analytical computations from a distribution.

Parameters:
edge_kind()[source]

Return edge kind identifier.

Return type:

str

__init__(method, constraint=<factory>, is_analytical=True)
Parameters:
Return type:

None

exception pysatl_core.distributions.registry.graph_primitives.GraphInvariantError[source]

Bases: RuntimeError

Raised when characteristic graph invariants are violated.

This error occurs when creating a RegistryView and the filtered graph does not satisfy the required invariants (e.g., definitive subgraph is not strongly connected).