kruskal? http://en.wikipedia.org/wiki/Kruskal's_algorithm
On Tue, Apr 9, 2013 at 3:18 PM, anup1pma <[email protected]> wrote: > hi... any one having idea of MST algo of o(n^2) where n is no. of nodes > and there are n^2 edges... I used fibonacci heaps but still getting TLE.. > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msg/google-code/-/Vhgwj5Lt1RYJ. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- *João Víctor Rocon Maia* www.joaovrmaia.com -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
