msmbuilder.tpt.find_top_paths

msmbuilder.tpt.find_top_paths(sources, sinks, tprob, num_paths=10, node_wipe=False, net_flux=None)

Calls the Dijkstra algorithm to find the top ‘NumPaths’.

Does this recursively by first finding the top flux path, then cutting that path and relaxing to find the second top path. Continues until NumPaths have been found.

Parameters:

sources : array_like, int

The indices of the source states

sinks : array_like, int

Indices of sink states

num_paths : int

The number of paths to find

Returns:

Paths : list of lists

The nodes transversed in each path

Bottlenecks : list of tuples

The nodes between which exists the path bottleneck

Fluxes : list of floats

The flux through each path