Hey folks,

Is there an efficient way to create a graph out of a sparse adjancy matrix? Otherwise my idea is rather to use np.nonzero and iterate over it all, but it didnt naive to me.

best,

vsilv