haskell / containers

Assorted concrete container types

Home Page:https://hackage.haskell.org/package/containers

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Check time bound for graphFromEdges

treeowl opened this issue · comments

#923 added the claim that graphFromEdges and graphFromEdges' are $O((V+E)\log V)$. While I haven't done a full analysis, this looks a bit loose to me. Aren't they actually $O(V + E \log V)$?

I stand corrected.