944,183 Members | Top Members by Rank

Community Center > Geeks' Lounge > Discrete Math
Ad:
Permalink
Apr 27th, 2007
0

Discrete Math

Expand Post »
How many edges are there in a tree with 21 verticies?

Also if that is not enough of an headache how about this. Can anyone help???

I am trying use the prism algorithm to find a minimal spanning tree for a weighted graph. The instuction are to (start at A) and give the weight of the minimal spanning tree found.
Attached Thumbnails
Click image for larger version Name: Exercise 5.2.jpg Views: 16 Size: 122.5 KB ID: 3285  
Similar Threads
Reputation Points: 10
Solved Threads: 0
Newbie Poster
wilj is offline Offline
11 posts
since Apr 2007
Permalink
Apr 27th, 2007
2

Re: Discrete Math

In a tree, every node has an edge 'pointing' to it, except for one root node.

You're trying to use Prim's Algorithm, not some "prism" algorithm. Read what Prim's Algorithm is, and follow the instructions the algorithm gives you.
Team Colleague
Reputation Points: 1135
Solved Threads: 173
Super Senior Demiposter
Rashakil Fol is offline Offline
2,480 posts
since Jun 2005
Permalink
Apr 27th, 2007
0

Re: Discrete Math

Prim's algorithm is applied to a connected weighted graph with n vertices, it actually produced a minimal spanning tree. Let T be as in the algorithm - the is, T is a set to which we add edges one at a time until we get a spanning tree. I read but do not quite understand.
Reputation Points: 10
Solved Threads: 0
Newbie Poster
wilj is offline Offline
11 posts
since Apr 2007
Permalink
Apr 27th, 2007
1

Re: Discrete Math

Read the algorithm's instructions itself and follow them. If you can't understand, ask yourself why you can't understand the written instructions, and fix the holes in your knowledge so that you do understand.
Team Colleague
Reputation Points: 1135
Solved Threads: 173
Super Senior Demiposter
Rashakil Fol is offline Offline
2,480 posts
since Jun 2005
Permalink
Apr 28th, 2007
0

Re: Discrete Math

Click to Expand / Collapse  Quote originally posted by Rashakil Fol ...
Read the algorithm's instructions itself and follow them. If you can't understand, ask yourself why you can't understand the written instructions, and fix the holes in your knowledge so that you do understand.
hahaha.. thats gotta be the most frank advice I've seen on daniweb..
Last edited by joshSCH; Apr 28th, 2007 at 1:19 am.
Reputation Points: 1315
Solved Threads: 10
Banned
joshSCH is offline Offline
4,845 posts
since Jul 2005

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
Message:
Previous Thread in Geeks' Lounge Forum Timeline: This is awesome!
Next Thread in Geeks' Lounge Forum Timeline: asl





About Us | Contact Us | Advertise | Acceptable Use Policy
Forum Index | Build Custom RSS Feed


Follow us on Twitter


© 2011 DaniWeb® LLC