danieljsharpe / k_distinct_paths Public

Python code to find the k shortest paths in a kinetic network (Markov chain)

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 29 Commits
README.md		README.md
k_distinct_paths.py		k_distinct_paths.py
kdistinctpaths.f90		kdistinctpaths.f90
matlab_plot_generic.m		matlab_plot_generic.m
min.data.regrouped		min.data.regrouped
ngt_block.py		ngt_block.py
ngt_cum.sh		ngt_cum.sh
plot_all_Epath.m		plot_all_Epath.m
random_ktn		random_ktn
random_ktn.cpp		random_ktn.cpp
random_ktn_plot.py		random_ktn_plot.py
rate_lim_cut		rate_lim_cut
rate_lim_cut.cpp		rate_lim_cut.cpp
read_mindata.py		read_mindata.py
ts.data.regrouped		ts.data.regrouped
ts.data.testcut		ts.data.testcut