graphinius icon indicating copy to clipboard operation
graphinius copied to clipboard

Introduce more (B|D|P)FS hooks at every stage of the algorithm

Open cassinius opened this issue 7 years ago • 0 comments

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 be fired at that stage. Implement, test and build into respective Brandes version!

For DFS, implement previsit- and postvisit-order...

cassinius avatar Mar 20 '18 22:03 cassinius