[Networkit] Getting pair of nodes with shortest path distance equal to the diameter?

Matteo Riondato matteo at cs.brown.edu
Thu Dec 15 12:39:44 CET 2016


Hi all,

After having computed the diameter or run APSP, is there an easy what to get the pair of nodes whose shortest path distance is equal to the diameter of the graph (or a vector of the pairs or any pair, if there are multiple pairs ) ?

Thank you,

Matteo




More information about the NetworKit mailing list