msmbuilder.MSMLib.ergodic_trim¶

msmbuilder.MSMLib.ergodic_trim(counts, assignments=None)[source]¶

Use Tarjan’s Algorithm to find maximal strongly connected subgraph.

Parameters:

counts : csr sparse matrix

transition counts

assignments : ndarray, optional

Optionally map assignments to the new states, nulling out disconnected regions.