From: dennison@telepath.com
Subject: Re: Minimal Cost Spanning Tree
Date: 1999/04/21
Date: 1999-04-21T00:00:00+00:00 [thread overview]
Message-ID: <7fkqbm$6lv$1@nnrp1.dejanews.com> (raw)
In-Reply-To: 7fkpgi$5m8$1@nnrp1.dejanews.com
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
next parent reply other threads:[~1999-04-21 0:00 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-04-21 0:00 dennison [this message]
1999-04-19 0:00 ` Minimal Cost Spanning Tree romantic_man
1999-04-21 0:00 ` Robert Dewar
1999-04-21 0:00 ` RemarQ User
1999-04-21 0:00 ` cs_man
1999-04-21 0:00 ` RemarQ User
1999-04-21 0:00 ` dennison
1999-04-22 0:00 ` Markus Kuhn
1999-04-21 0:00 ` RemarQ User
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox