[Networkit] DirectedGraph in NetworKit
christian.staudt at kit.edu
Tue Jun 10 11:38:02 CEST 2014
thanks for the mature design and clear description. The result of our discussion last week was to go with the „BigGraph“ approach to achieve Cython compatibility, performance and low refactoring overhead.
Of course the performance needs to be proven - I am very interested in benchmark results.
Also had a quick look at the code. For the final version, please
- make sure the method and member documentation is in a good state
- use line breaks before and after a method body, even if all could fit in one line
- check recent updates to the old graph class (and NetworKit in general) and make sure that they are included when we merge
Hope this works out and we can release the directed graph in 3.3.
Am 06.06.2014 um 17:52 schrieb Klara Reichard <klarareichard at googlemail.com>:
> As you may know, Marvin and I are working on a directed graph data structure.
> So far we have three approaches, which are not totally satisfying.
> You can read about these in the attached document.
> At the moment we prefer the solution "BigGraph", but if anyone has a good idea
> we would definitely take a look at it.
> Thanks and have a nice weekend.
> Greetings, Klara
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
More information about the NetworKit