Discrete Math

Reply

Join Date: Apr 2007
Posts: 11
Reputation: wilj is an unknown quantity at this point 
Solved Threads: 0
wilj wilj is offline Offline
Newbie Poster

Discrete Math

 
0
  #1
Apr 27th, 2007
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
Exercise 5.2.jpg  
Reply With Quote Quick reply to this message  
Join Date: Jun 2005
Posts: 2,039
Reputation: Rashakil Fol is just really nice Rashakil Fol is just really nice Rashakil Fol is just really nice Rashakil Fol is just really nice 
Solved Threads: 139
Team Colleague
Rashakil Fol's Avatar
Rashakil Fol Rashakil Fol is offline Offline
Super Senior Demiposter

Re: Discrete Math

 
0
  #2
Apr 27th, 2007
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.
All my posts may be redistributed under the GNU Free Documentation License.
Reply With Quote Quick reply to this message  
Join Date: Apr 2007
Posts: 11
Reputation: wilj is an unknown quantity at this point 
Solved Threads: 0
wilj wilj is offline Offline
Newbie Poster

Re: Discrete Math

 
0
  #3
Apr 27th, 2007
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.
Reply With Quote Quick reply to this message  
Join Date: Jun 2005
Posts: 2,039
Reputation: Rashakil Fol is just really nice Rashakil Fol is just really nice Rashakil Fol is just really nice Rashakil Fol is just really nice 
Solved Threads: 139
Team Colleague
Rashakil Fol's Avatar
Rashakil Fol Rashakil Fol is offline Offline
Super Senior Demiposter

Re: Discrete Math

 
0
  #4
Apr 27th, 2007
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.
All my posts may be redistributed under the GNU Free Documentation License.
Reply With Quote Quick reply to this message  
Join Date: Jul 2005
Posts: 4,845
Reputation: joshSCH is on a distinguished road 
Solved Threads: 10
joshSCH's Avatar
joshSCH joshSCH is offline Offline
Banned

Re: Discrete Math

 
0
  #5
Apr 28th, 2007
Originally Posted by Rashakil Fol View Post
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.
Reply With Quote Quick reply to this message  
Reply

This thread is more than three months old.
Perhaps start a new thread instead?
Message:



Similar Threads
Other Threads in the Geeks' Lounge Forum
Thread Tools Search this Thread



About Us | Contact Us | Advertise | DaniWeb | Acceptable Use Policy | RSS Feed

©2003 - 2009 DaniWeb® LLC