A problem is that this is a directed graph. With kruskal algorithm, the case may be that a node in the result has multiple parents.
Best Regards, Hongzhi Wang ----- Original Message ----- From: "Siva" <[EMAIL PROTECTED]> To: "Algorithm Geeks" <algogeeks@googlegroups.com> Sent: Wednesday, August 02, 2006 10:33 PM Subject: [algogeeks] Re: Maximum spanning forest > > > Max spanning forest is not NP hard....u can write a simple kruskal > algorithm that runs in )(E log* V) for this....as u can see it is > definitely polynomial unlike longest path problem > > Siva > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
