You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to SJSUcmpe130
Is the minimum spanning tree that same as weighted shortest path? What are the main differences in the algorithm for finding both?
Frank (sjsu) Lin
unread,
Nov 21, 2011, 12:51:53 PM11/21/11
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to chrisb...@gmail.com, SJSUcmpe130
The objective is different and the selection is different. For example, if a link is "shorter" but it causes a loop, it can not be used in spanning tree.