Hi, I was wanted to know if we can do better than O(V*V) to calculate the sprague-grundy values of DAG? We can achieve O(V*V) by topologically sorting the graph and then iterating through the vertices.
Is there any known algorithm to improve this? Regards Satyam Shekhar --~--~---------~--~----~------------~-------~--~----~ 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 algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
