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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,cb02ea4beb29433b
X-Google-Attributes: gid103376,public
From: dennison@telepath.com
Subject: Re: Minimal Cost Spanning Tree
Date: 1999/04/21
Message-ID: <7fkqbm$6lv$1@nnrp1.dejanews.com>#1/1
X-Deja-AN: 469125749
References: <Y72T2.4862$_c.1790982@WReNphoon3>
 <7fjbre$uah$1@nnrp1.dejanews.com> <7fkpgi$5m8$1@nnrp1.dejanews.com>
X-Http-Proxy: 1.0 x14.dejanews.com:80 (Squid/1.1.22) for client 204.48.27.130
Organization: Deja News - The Leader in Internet Discussion
X-Article-Creation-Date: Wed Apr 21 15:20:27 1999 GMT
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.5 [en] (WinNT; I)
Date: 1999-04-21T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <7fkpgi$5m8$1@nnrp1.dejanews.com>,
  cs_man@my-dejanews.com wrote:
> If I could somehow obtain a copy of this implementation, that would be
> great!!:) An instructive one sounds good as well!
>
> In article <7fjbre$uah$1@nnrp1.dejanews.com>,
>   Robert Dewar <robert_dewar@my-dejanews.com> wrote:
> > In article <Y72T2.4862$_c.1790982@WReNphoon3>,
> >   romantic_man@usa.net wrote:
> > > Would anyone happen to have a greedy implementation of a
> > > of a minimal cost spanning tree??
> >
> > Yes, I have a version, it is an assignment I have given
> > out several times, and is definitely an instructive one!

Unfortunatly some students are incapable of taking a hint, unless it is
attached to the flat end of a shovel vigorously applied to their heads... 
:-)

--
T.E.D.

-----------== Posted via Deja News, The Discussion Network ==----------
http://www.dejanews.com/       Search, Read, Discuss, or Start Your Own