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: <7fla4o$mfq$1@nnrp1.dejanews.com> (raw)
In-Reply-To: LemT2.4631$fz.1515134@WReNphoon2
In article <LemT2.4631$fz.1515134@WReNphoon2>,
romantic_man@usa.net (RemarQ User) wrote:
> I apologize, I thought these discussion groups
> were for help, but it seems as though you like to use them as a playground.
No. Folks often *do* get help here. But each newsgroup has its own culture and
set of rules. This particular newsgroup has a rather large amount of
participation from university professors. Perhaps for that reason, one of the
unwritten rules here is that we *don't* write student's assignments for them.
If you end up with a large amount of it written, but some seemingly arcane
part of the Ada language is tripping you up, we will generally be glad to
help. Even a simple question like "how do I write a linked data structure?"
is liable to get a good response.
Good luck with the assignment.
--
T.E.D.
-----------== Posted via Deja News, The Discussion Network ==----------
http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own
next prev 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 Minimal Cost Spanning Tree dennison
1999-04-19 0:00 ` romantic_man
1999-04-21 0:00 ` RemarQ User
1999-04-21 0:00 ` Robert Dewar
1999-04-21 0:00 ` cs_man
1999-04-21 0:00 ` RemarQ User
1999-04-21 0:00 ` dennison [this message]
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