`ragraph.analysis.sequence._markov`#

Sorting algorithm based on the node dependency/influence in a Markov chain.

Module Contents#

markov_sequencing(→ Tuple[ragraph.graph.Graph, ...)

`markov_params`
`markov_sequencing_analysis`

ragraph.analysis.sequence._markov.markov_sequencing(graph: ragraph.graph.Graph, root: Optional[Union[str, ragraph.graph.Node]] = None, nodes: Optional[Union[List[ragraph.graph.Node], List[str]]] = None, edge_weights: Optional[List[str]] = None, inf: float = markov_params['inf'].default, dep: float = markov_params['dep'].default, mu: float = markov_params['mu'].default, scale: bool = markov_params['scale'].default, inherit: bool = True, loops: bool = False, inplace: bool = True, names: bool = False, safe: bool = True, **kwargs) → Tuple[ragraph.graph.Graph, List[ragraph.graph.Node]]#