combinatorics¶
Perform permutations on the edges of a StateTransitionGraph
.
In a StateTransitionGraph
, the edges represent quantum states, while the
nodes represent interactions. This module provides tools to permutate, modify
or extract these edge and node properties.
-
initialize_graph
(topology: expertsystem.reaction.topology.Topology, particles: expertsystem.particle.ParticleCollection, initial_state: Sequence[Union[str, Tuple[str, Sequence[float]]]], final_state: Sequence[Union[str, Tuple[str, Sequence[float]]]], final_state_groupings: Optional[Union[List[List[List[str]]], List[List[str]], List[str]]] = None) → List[expertsystem.reaction.topology.StateTransitionGraph[Tuple[expertsystem.particle.Particle, float]]][source]¶
-
match_external_edges
(graphs: List[expertsystem.reaction.topology.StateTransitionGraph[Tuple[expertsystem.particle.Particle, float]]]) → None[source]¶
-
perform_external_edge_identical_particle_combinatorics
(graph: expertsystem.reaction.topology.StateTransitionGraph) → List[expertsystem.reaction.topology.StateTransitionGraph][source]¶ Create combinatorics clones of the
StateTransitionGraph
.In case of identical particles in the initial or final state. Only identical particles, which do not enter or exit the same node allow for combinatorics!