This module it the realization of algorthms from two different papers on finidng the optimized normalized cut of both directed and undirect graphs. See the notebooks folder for detailed examples of finding optimal clustering for both directed and undirected graphs.
Dependencies: Python 3.7.6, networkx, graphviz, numpy, scripy, sklearn, IPython.display.
Paper References: https://www.cis.upenn.edu/~jshi/papers/pami_ncut.pdf, https://sites.stat.washington.edu/mmp/Papers/sdm-wcuts.pdf,https://sites.cs.ucsb.edu/~veronika/MAE/arandomwalksviewofimgsegmt_meila_shi_nips00.pdf
To install, do
cd Optimized_Ncut_Directed_and_Undirected
. install.sh