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.6 required=5.0 tests=BAYES_20,INVALID_MSGID,XPRIO
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,b0c7e8bd0427f3d0,start
X-Google-Attributes: gid103376,public
From: "Marcin Harlak" <mharlak@zap.com.pl>
Subject: Help: MST
Date: 2000/02/14
Message-ID: <sZPp4.11267$Q3.288301@news.tpnet.pl>#1/1
X-Deja-AN: 585661247
X-Priority: 3
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2014.211
X-Complaints-To: abuse@tpsa.pl
X-Trace: news.tpnet.pl 950520792 212.160.89.113 (Mon,
 14 Feb 2000 10:33:12 MET)
Organization: TPNET - http://www.tpnet.pl
X-MSMail-Priority: Normal
NNTP-Posting-Date: Mon, 14 Feb 2000 10:33:12 MET
Newsgroups: comp.lang.ada
Date: 2000-02-14T00:00:00+00:00
List-Id: <comp.lang.ada>

Hello, I am writing from Poland. I'm starting programming in Ada. I can't
write programms in Ada very well, but I need short procedure which can
evaluate Minimum Spanning Tree. I would be very grateful for Yours help in
getting source for this algorithm in Ada.

Thanks
Karol Izydorski