Thanks so much!!
Best regards,
José Luis
De: Daπid
Para: Discussion of Numerical Python
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 wrote
Hi experts!
How can I create a networkx graph from the adjacency matrix M?
Thanks a lot,
José Luis
De: Daπid
Para: Discussion of Numerical Python
Enviado: jueves, 5 de septiembre de 2013 12:56
Asunto: Re: [Numpy-discussion] Stick intersection path
?
Thans a lot!
José Luis
De: Daπid
Para: Discussion of Numerical Python
Enviado: jueves, 5 de septiembre de 2013 11:06
Asunto: Re: [Numpy-discussion] Stick intersection path algorithm
On 5 September 2013 13:14, Josè Luis Mietta wrote:
2. Using network
On 5 September 2013 17:03, Josè Luis Mietta 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
On 5 September 2013 13:14, Josè Luis Mietta wrote:
> 2. Using networkx or other tool: how can I obtain the 'clusters size'
> distribution (that is: number of clusters of size 'D', for all
> cluster-sizes)?
This is best asked in their mailing list. A possible way is:
np.bincount([len(i) for i in
t;
>
>The problem is that
>
>G.connected_component_containing_vertex()
>
>explore all the sub-graph.
>
>How can I do (what is the code) for stop the iteration when the algorithm
>found 'first-stick'?
>
>Waiting for your answers.
>
>Thanks a l
e sub-graph formed by
> 'second_stick' and all sticks 'connected' with 'second_stick'.
>
> The problem is that
>
> G.connected_component_containing_vertex()
>
> explore all the sub-graph.
>
> How can I do (what is the code) for stop the iteration w
ers.
Thanks a lot!!
De: Robert Kern
Para: Discussion of Numerical Python
Enviado: lunes, 2 de septiembre de 2013 10:40
Asunto: Re: [Numpy-discussion] Stick intersection path algorithm
On Sun, Sep 1, 2013 at 11:55 PM, Josè Luis Mietta
wrote:
>
> Hi e
On Sun, Sep 1, 2013 at 11:55 PM, Josè Luis Mietta <
joseluismie...@yahoo.com.ar> wrote:
>
> Hi experts!
>
> I wanna study the intersection between line segments (sticks).
> I wrote a algorithm that generate a matrix, M, with N rows and N columns.
The M-element Mij is 1 if stick number 'i' intersect
On 2 September 2013 02:50, Josè Luis Mietta wrote:
> I wanna see if two line segments are connected by a path formed by line
> segments intersected.
>
You could build a network where each segment is a node and an intersection
is a link. Then, you could use NetworkX connected_components to get gro
-discussion] Stick intersection path algorithm
On Sun, Sep 1, 2013 at 3:55 PM, Josè Luis Mietta
wrote:
Given two arbitrary sticks, i need a simple and effective algorithm that
determinate if that two sticks are conected by a 'intersected-sticks' path.
>
>
>
do you mean a test
On Sun, Sep 1, 2013 at 3:55 PM, Josè Luis Mietta <
joseluismie...@yahoo.com.ar> wrote:
> Given two arbitrary sticks, i need a simple and effective algorithm that
> determinate if that two sticks are conected by a 'intersected-sticks' path.
>
>
do you mean a test to see if two line segments interse
Hi experts!
I wanna study the intersection between line segments (sticks).
I wrote a algorithm that generate a matrix, M, with N rows and N columns. The
M-element Mij is 1 if stick number 'i' intersect stick number 'j' (obviously M
is symmetric).
Given two arbitrary sticks, i need a simple and
13 matches
Mail list logo
