[Networkit] Betweenness centrality algorithms, small bugs and code organization question
matteo at cs.brown.edu
Tue Jun 23 16:00:52 CEST 2015
> On Jun 23, 2015, at 9:13 AM, Matteo Riondato <matteo at cs.brown.edu> wrote:
>> On Jun 22, 2015, at 5:28 PM, Christian Staudt <christian.staudt at kit.edu> wrote:
>> On 22 Jun 2015, at 19:18, Matteo Riondato <matteo at cs.brown.edu> wrote:
>>> 2) I would like to understand the rationale behind putting the above algorithms in the Centrality module, while the DynApproxBetweenness is in the graph module (at least in the documentation, but not in the code?) Perhaps this is a bug in the documentation?
>> DynApproxBetweenness is in the centrality module as far as the code is concerned. Probably a documentation bug - where exactly did you find it?
> In the documentation for the C++ modules (https://networkit.iti.kit.edu/data/uploads/docs/NetworKit-Doc/python/html/cpp_doc.html) .
> The DynApproxBetweenness class is listed under the graph module (https://networkit.iti.kit.edu/data/uploads/docs/NetworKit-Doc/doxyhtml/group__graph.html)
> while the ApproxBetweenness* and the Betweenness classes are in the centrality module (https://networkit.iti.kit.edu/data/uploads/docs/NetworKit-Doc/doxyhtml/group__centrality.html)
I believe this is due to line 24 of DynApproxBetwenness.h, which is
but should be
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 163 bytes
Desc: Message signed with OpenPGP using GPGMail
More information about the NetworKit