`ragraph.analysis.sequence._scc_tearing`#

A sequencing algorithm for cyclic graphs that tears cycles based on a metric (penalty) function. By default we use the metric that the Markov sequencing algorithm uses to sort all nodes straight away.

Module Contents#

Functions#

 `scc_tearing`(→ Tuple[ragraph.graph.Graph, ...) `scc_tearing_algorithm`(→ Generator[ragraph.node.Node, ...)

Attributes#

ragraph.analysis.sequence._scc_tearing.params#
ragraph.analysis.sequence._scc_tearing.scc_tearing_analysis#
ragraph.analysis.sequence._scc_tearing.scc_tearing(graph: ragraph.graph.Graph, decision: Callable[[ragraph.graph.Graph, List[ragraph.node.Node]], ragraph.node.Node], decision_args: Optional[Dict[str, Any]] = None, root: Optional[Union[str, ragraph.node.Node]] = None, nodes: Optional[Union[List[ragraph.node.Node], List[str]]] = None, inherit: bool = True, loops: bool = False, edge_weights: Optional[List[str]] = None, inplace: bool = True, names: bool = False, safe: bool = True, **kwargs) Tuple[ragraph.graph.Graph, List[ragraph.node.Node]]#
ragraph.analysis.sequence._scc_tearing.scc_tearing_algorithm(graph: ragraph.graph.Graph, nodes: List[ragraph.node.Node], inherit: bool, loops: bool, decision: Callable[[ragraph.graph.Graph, List[ragraph.node.Node]], int], decision_args: Optional[Dict[str, Any]] = None) Generator[ragraph.node.Node, None, None]#