pattern_clustering.pattern_automaton.pattern_automaton_to_path

pattern_automaton_to_path(g: PatternAutomaton, **kwargs) → list[source]

Computes the path having the lowest density (and hence describing the best pattern-based decomposition) of an input PatternAutomaton.

Parameters: g (PatternAutomaton) – The queried PatternAutomaton instance.
Returns: The path minimizing the density.