Bernd Malle
- better OO - better testability through spies
... as a first step for divide&conquer version of Brandes algorithm
Right now, edges, nodes, and graphs have different implementations of clone functions originated in different use cases... - Define cloning use cases - Systematize - Write own cloning test suite...
given - a set of nodes (Array) generate an adjacency list for just this one sub-graph. To be used in graph-partitioning as well as partition-based (parallel) algorithms.
... adjacency list is unfortunately not possible, since we do not know whether a number following a node is another node or an edge weight ...
E.g., for betweenness computation via Brandes, we need to backtrack all nodes in the exact ordering they were visited - which is not possible right now as no callback can...