igraph

  1. Bug #1116657
  2. Comment #1

Comment 1 for bug 1116657

Revision history for this message
Jan Katins (jasc) wrote :

This is a algorithm with O(v) time complexity, but similar results than closeness/betweenes...