TraversalTree

Symbolica documentation for getting started, symbolic expressions, numerical evaluation, pattern matching, and APIs in Python and Rust.

`TraversalTree`

class TraversalTree

A native DFS or BFS result retaining the immutable physics diagram.

Using the setup in the FeynmanDiagram class example:

tree = diagram.depth_first_traverse(0)
discovery_order = [vertex.id for vertex in tree.nodes]

Name	Description
`nodes`	Physics vertices in traversal discovery order.
`subgraph`	Traversal edges as a reusable physics region, retaining isolated roots.

TraversalTree.nodes: builtins.list[DiagramVertex]

Physics vertices in traversal discovery order.

order = [vertex.id for vertex in diagram.depth_first_traverse(0).nodes]

TraversalTree.subgraph: Subgraph

Traversal edges as a reusable physics region, retaining isolated roots.

edges = diagram.depth_first_traverse(0).subgraph.edges

Name	Description
`ancestors`	Strict ancestors from the immediate parent to the root.
`children`	Immediate children in discovery order.
`covers`	Restrict a physics region to vertices visited by this traversal.
`fundamental_cycle`	Fundamental cycle closed by a half-edge, or None for a tree edge.
`parent`	Immediate parent vertex, or None for the traversal root.

TraversalTree.ancestors(node: builtins.int) -> builtins.list[DiagramVertex]

Strict ancestors from the immediate parent to the root.

tree = diagram.depth_first_traverse(0)
ancestors = tree.ancestors(tree.nodes[-1].id)

TraversalTree.children(node: builtins.int) -> builtins.list[DiagramVertex]

Immediate children in discovery order.

children = diagram.depth_first_traverse(0).children(0)

TraversalTree.covers(subgraph: Subgraph) -> Subgraph

Restrict a physics region to vertices visited by this traversal.

region = diagram.subgraph(edges=[0])
covered = diagram.depth_first_traverse(0).covers(region)

TraversalTree.fundamental_cycle(half_edge: builtins.int) -> typing.Optional[Subgraph]

Fundamental cycle closed by a half-edge, or None for a tree edge.

tree = diagram.depth_first_traverse(0)
cycles = [tree.fundamental_cycle(half.id) for half in diagram.half_edges if not half.edge.is_dangling]

half_edge (int) Native diagram half-edge ID whose endpoints are in this traversal.

TraversalTree.parent(node: builtins.int) -> typing.Optional[DiagramVertex]

Immediate parent vertex, or None for the traversal root.

tree = diagram.depth_first_traverse(0)
parent = tree.parent(tree.nodes[-1].id)