***** To join INSNA, visit http://www.insna.org *****
Kruskal's algorithm is pretty easy to do 'by hand' for a small data set:
It will be easiest to do this if you have the original graph laid out
(so that you can tell by inspection whether removing an edge will
disconnect the graph).
Hope this helps.
On Mon, Apr 23, 2012 at 3:23 AM, rick davies <[log in to unmask]> wrote:
> ***** To join INSNA, visit http://www.insna.org ***** Hi all
> Can anyone point me to instructions on how to identify a minimum spanning
> tree in a small data set, either manually or with help of software (named).
> I am looking at 2-mode networks with a max size of about 20 cases and 10
> with thanks, rick davies
> _____________________________________________________________________ SOCNET
> is a service of INSNA, the professional association for social network
> researchers (http://www.insna.org). To unsubscribe, send an email message to
> [log in to unmask] containing the line UNSUBSCRIBE SOCNET in the body of
> the message.
Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
It's that moment of dawning comprehension that I live for. -- Bill Watterson
My opinions are too rational and insightful to be those of any organization.
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.