[Numpy-discussion] Stick intersection path algorithm

[Josè Luis Mietta]

Hi experts!

How can I create a networkx graph from the adjacency matrix M?
 
Thanks a lot,
José Luis




________________________________
 De: Daπid <davidmenhur at gmail.com>
Para: Discussion of Numerical Python <numpy-discussion at scipy.org> 
Enviado: jueves, 5 de septiembre de 2013 12:56
Asunto: Re: [Numpy-discussion] Stick intersection path algorithm
 


On 5 September 2013 17:03, Josè Luis Mietta <joseluismietta at yahoo.com.ar> wrote:

The array ([ 0, 39,  7,  3,  1,  1,  0,  0,  0,  0,  1,  0,  0,  0,  0,  0,  0, 0,  0,  1]) means that in the sistem (graph) are : 4 cluster of size 1, one cluster of size 3, one cluster of size 7 and one cluste of size 39?
No, it means there are 39 of size 1, 7 of size 2 and so on.


David.
_______________________________________________
NumPy-Discussion mailing list
NumPy-Discussion at scipy.org
http://mail.scipy.org/mailman/listinfo/numpy-discussion
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/numpy-discussion/attachments/20130905/bd381e4b/attachment.html>