Siva wrote: > 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
Or u can write Prim's algorithm which has the same complexity. But for some graphs it has a better (faster) running time. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
