Re: Minimal Cost Spanning Tree

[mgk25@cl.cam.ac.uk (Markus Kuhn)]

In article <LemT2.4631$fz.1515134@WReNphoon2>, romantic_man@usa.net (RemarQ User) writes:
|> I apologize, I thought these discussion groups
|> were for help, but it seems as though you like to use them as a playground.
|> I am not the type to just take code from someone else and turn it in.  I
|> just wanted a little help, but it seems as though I can't get it here.

Dear anonymous Ada programming student,

In the case of a programming class assignment, the *best* help
you can get is some encouragement to work out the solution
for yourself.

Most people here are quite well trained in computer science and they
can immediately distinguish a typical class assignment problem
from a real-world problem. It is not appropriate to ask here for
someone doing your entire homework, and it is very rude for you
to not even reveal that this is your homework problem.

If you have a specific question, then people here will be happy to help
you. But first you will have to learn how to ask a specific question
and not just repeat the text of the assignment. And now go and read
in [Corman/Leiserson/Rivest: Introduction to Algorithms, MIT Press]
the section about Kruskal's algorithm, and every Ada textbook will
teach you how to convert the pseudo code that you will find into a
working quality Ada implementation. You won't believe how good it
feels once you've cracked the problem yourself.

Markus

-- 
Markus G. Kuhn, Computer Laboratory, University of Cambridge, UK
Email: mkuhn at acm.org,  WWW: <http://www.cl.cam.ac.uk/~mgk25/>