From: SourceForge.net <no...@so...> - 2007-02-28 21:05:43
|
Read and respond to this message at: https://sourceforge.net/forum/message.php?msg_id=4183719 By: titaniumrain Hi Joshua, Sorry for such a brief conclusion. The issue is as follows, Given two DAGs, D1 and D2 (edge weight is fixed to 1) D1: root1 ----> A | ----> B D2: root2 ----> C | ----> D The minimum spanning tree of D1 and D2 should be themselves if my understanding of MSF concept is correct? If not, the conclusion of "the output is not right" may not hold. :P The spanning trees I got from the source code (shown in the above post) are "A" and "D", at least, these two nodes are what have been displayed. Hope that explains clearly my observation. Cheers, Vincent ______________________________________________________________________ You are receiving this email because you elected to monitor this forum. To stop monitoring this forum, login to SourceForge.net and visit: https://sourceforge.net/forum/unmonitor.php?forum_id=252062 |