From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,d90f07a655cd99,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-23 03:42:46 PST
Path: 
 nntp.gmd.de!newsserver.jvnc.net!howland.reston.ans.net!news2.near.net!news.mathworks.com!uunet!pipex!sunsite.doc.ic.ac.uk!nntp0.brunel.ac.uk!strath-cs!bradford.ac.uk!M.Hofman
From: M.Hofman@bradford.ac.uk (m.hofman)
Newsgroups: comp.lang.ada
Subject: kruskals algorithm - min spanning tree
Date: Mon, 23 Jan 1995 11:42:46 GMT
Organization: University of Bradford, UK
Message-ID: <1995Jan23.114246.10452@bradford.ac.uk>
NNTP-Posting-Host: ccw306.acc.brad.ac.uk
X-Newsreader: TIN [version 1.2 PL2]
Originator: mhofman@ccw306
Date: 1995-01-23T11:42:46+00:00
List-Id: <comp.lang.ada>


would anyone be able to help me out.irequire an implementation of kruskals
algorithm for finding a minimumspanning tree.implemented using priority
queues.Also can someone explain how this algorithm can have different
implementations.Any help would be greatly appreciated.


tankyou


Mat hofman
m.hofman@bradford.ac.uk