On 03/12/2014 05:28 PM, v k wrote: > 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.
There is not built-in function for this. All you need to do is to iterate over the nonzero entries, and call Graph.add_edge(). Best, Tiago -- Tiago de Paula Peixoto <[email protected]>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
