Public bug reported:
I'm looking at fgl instead of Data.Graph because I want a graph library
that supports efficient deletions. I know that for Data.Graph it's about
O(|E(G)|) to delete a vertex because you have to destroy and rebuild the
graph. But without looking at the source I can't see how efficient
Data.Graph.Inductive.Graph.delNode is, because the Haddocks don't
include complexity information.
** Affects: haskell-fgl (Ubuntu)
Importance: Undecided
Status: New
--
Haddocks should include complexity information
https://bugs.launchpad.net/bugs/183286
You received this bug notification because you are a member of Ubuntu
Bugs, which is the bug contact for Ubuntu.
--
ubuntu-bugs mailing list
ubuntu-bugs@lists.ubuntu.com
https://lists.ubuntu.com/mailman/listinfo/ubuntu-bugs
