[Date Index] [Thread Index] [Author Index]

Re: Finding Clusters

• To: mathgroup at smc.vnet.net
• Subject: [mg104548] Re: Finding Clusters
• From: Ray Koopman <koopman at sfu.ca>
• Date: Wed, 4 Nov 2009 01:30:26 -0500 (EST)
• References: <hconfd$113$1@smc.vnet.net>

See "Faster ways to unionize intersecting sets?", Oct 4-16, 2006:

http://groups.google.ca/group/comp.soft-sys.math.mathematica/browse_frm/thread/ba33fcb79298bf4c

On Nov 2, 11:52 pm, fd <fdi... at gmail.com> wrote:
> All.
>
> I have a list which represents some natural event. These events are
> listed pair-wise, which corresponds to event happening within certain
> time interval from each other, as below
>
> event={{1,2},{1,3},{3,4},{5,6},{7,8},{8,10}}
>
> I wish to find a thread of events, i.e. if event A is related to B
> and B to C, I wish to group {A,B,C} together. For the example above
> I would have
>
> {{1,2,3,4},{5,6},{7,8,10}}
>
> This would correspond to do a Graph Plot and identifying the parts
> which are disconnected It should be simple but I'm really finding it
> troublesome.