ααLoop docs
On this page

TraversalTree

linnet_py Class

TraversalTree()

A graph-bound DFS or BFS traversal tree.

Member details

subgraph

Property · read-only
#
subgraph: Subgraph

No description is available for this member.

nodes

Property · read-only
#
nodes: list[Node]

No description is available for this member.

half_edges

Property · read-only
#
half_edges: list[HalfEdge]

No description is available for this member.

covers

Method
#
covers(subgraph: Subgraph) -> Subgraph

No description is available for this member.

Parameters

NameTypeDefaultDescription
subgraphSubgraph——

parent

Method
#
parent(node: Node | int | str) -> Optional[Node]

Return the immediate parent, or None for the traversal root.

Parameters

NameTypeDefaultDescription
nodeNode | int | str——

children

Method
#
children(node: Node | int | str) -> list[Node]

Return the immediate children in traversal discovery order.

Parameters

NameTypeDefaultDescription
nodeNode | int | str——

ancestors

Method
#
ancestors(node: Node | int | str) -> list[Node]

Return strict ancestors from the immediate parent through the root.

Parameters

NameTypeDefaultDescription
nodeNode | int | str——

fundamental_cycle

Method
#
fundamental_cycle(half_edge: _HalfEdgeTarget) -> Optional[Cycle]

Return the fundamental cycle closed by an internal edge, or None for a tree edge.

Parameters

NameTypeDefaultDescription
half_edge_HalfEdgeTarget——

View generated signature source: docs/api/python/linnet-py.pyi:1197