Use NetworkX + breadth first search and you are done.
On Wed, Jul 9, 2014 at 12:31 PM, Robert Kern wrote:
> On Wed, Jul 9, 2014 at 1:29 AM, Josè Luis Mietta
> wrote:
> > Hi experts!!
> >
> > I am studying the intersection between line segments (sticks). I have an
> > Numpy array (M) correspon
On Wed, Jul 9, 2014 at 1:29 AM, Josè Luis Mietta
wrote:
> Hi experts!!
>
> I am studying the intersection between line segments (sticks). I have an
> Numpy array (M) corresponding to the intersection graph of the system (the
> element Mij = 1 if the sticks' i 'and' 'j' intersect, and Mij = 0 if no
Hi experts!!
I am studying the intersection between line
segments (sticks). I have an Numpy array (M) corresponding to the
intersection graph of the system (the element Mij = 1 if the sticks' i
'and' 'j' intersect, and Mij = 0 if not intersect).
I want to
determine the number of elements that
