I need "C"code to support a MST using Prim's Algorithm. I am currently
using Visual Studio 6.0 The input to the problem needs to be random
number generated and be of a specific number of "n" selected by the
user. The resulting MST from the user's various inputs will be timed
(I have code to do that.).

---

Request for Question Clarification by mathtalk-ga on 25 Apr 2005 12:48 PDT

Hi, h6330-ga:

I can certainly understand wanting an implementation in C of Prim's
algorithm for minimum(-weight) spanning trees.   However it seems that
your requirement is to written in addition to this some sort of
"random" graph generator.

Since a graph has a number of edges as well as vertices, it is not
clear which of these (if either) should relate to the value "n"
mentioned in your question.

While a Researcher might well be able to point you to some open source
code for Prim's algorithm, a Clarification of what you require for the
generation of graphs is needed before I could proceed.

regards, mathtalk-ga