Hello guys,
I would like implement an enhancement of kruskal algorithm as provided
in this paper http://algo2.iti.kit.edu/documents/fkruskal.pdf.
<http://algo2.iti.kit.edu/documents/fkruskal.pdf>
This Algorithm gives an expected complexity of O(E + Vlog(v)*log(E/V)
where E is number of edges and V be number of edges. This Algorithm works
quite well for large and dense graph. After seeing source code of MST, the
code had a TODO task under
kruskal function. Any suggestions ?
--
*Disclaimer: *This email and any files transmitted with it are confidential
and intended solely for the use of the individual or entity to whom they
are addressed. If you have received this email in error please notify the
system manager. This message contains confidential information and is
intended only for the individual named. If you are not the named addressee
you should not disseminate, distribute or copy this e-mail. Please notify
the sender immediately by e-mail if you have received this e-mail by
mistake and delete this e-mail from your system. If you are not the
intended recipient you are notified that disclosing, copying, distributing
or taking any action in reliance on the contents of this information is
strictly prohibited.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
