Google Answers Logo
View Question
Q: MST using Prim's Algorithm ( No Answer,   0 Comments )
Subject: MST using Prim's Algorithm
Category: Computers > Algorithms
Asked by: h6330-ga
List Price: $20.00
Posted: 24 Apr 2005 13:21 PDT
Expires: 05 May 2005 16:04 PDT
Question ID: 513590
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
There is no answer at this time.

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy