fluxes(sources, sinks, msm[, for_committors]) | 
Compute the transition path theory flux matrix. | 
net_fluxes(sources, sinks, msm[, for_committors]) | 
Computes the transition path theory net flux matrix. | 
fraction_visited(source, sink, waypoint, msm) | 
Calculate the fraction of times a walker on tprob going from sources to sinks will travel through the set of states waypoints en route. | 
hub_scores(msm[, waypoints]) | 
Calculate the hub score for one or more waypoints | 
paths(sources, sinks, net_flux[, ...]) | 
Get the top N paths by iteratively performing Dijkstra’s algorithm. | 
top_path(sources, sinks, net_flux) | 
Use the Dijkstra algorithm for finding the shortest path connecting a set of source states from a set of sink states. | 
committors(sources, sinks, msm) | 
Get the forward committors of the reaction sources -> sinks. | 
conditional_committors(source, sink, ...) | 
Computes the conditional committors \(q^{ABC^+}\) which are is the probability of starting in one state and visiting state B before A while also visiting state C at some point. | 
mfpts(msm[, sinks, lag_time]) | 
Gets the Mean First Passage Time (MFPT) for all states to a set of sinks. |