Google Answers: Algorithms in Computer Science

View Question

Q: Algorithms in Computer Science ( No Answer, 0 Comments )

Question

Subject: Algorithms in Computer Science
Category: Computers > Algorithms
Asked by: budigi-ga
List Price: $2.00

Posted: 15 Dec 2002 18:23 PST
Expires: 14 Jan 2003 18:23 PST
Question ID: 125147

In Prim’s Algorithm for finding the minimal spanning tree of a graph,
it is necessary at each step to find the smallest edge adjacent to one
of the vertices already added to the tree.
(a) Discuss an efficient way to handle this portion of the problem and
how it impacts the overall efficiency of the Algorithm.
(b) Discuss how this Algorithm is or is not a greedy solution. Be
complete.

Answer

There is no answer at this time.

Comments

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 answers-support@google.com with the question ID listed above. Thank you.

Search Google Answers for

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