[graph-tool] Inconsistent notation in algorithm complexities

Hi, When looking through the documentation for the Closeness and Betweenness centrality measures, I noticed that they use an inconsistent notation. The complexity of Betweenness is listed as: O(VE), while for Closeness it is O(N(N+E)). I'm presuming that N and V are both the number of nodes, if this is not the case, then perhaps a clear definition of what N is might be useful, as I don't see one. In any case, thanks for the great package! Best regards, Sander -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.