[Networkit] All pairs shortest path

Christian Staudt christian.staudt at kit.edu
Tue Dec 13 12:04:12 CET 2016


> On 13 Dec 2016, at 10:27, Henning Meyerhenke <henning.meyerhenke at kit.edu> wrote:
> 
> Will the APSP problem be executed once or do they want to make repeated
> queries? What is the exact output required, (an estimate of) the full
> distance matrix?
> 
> There is some support for APSP, but I doubt something matching your
> scenario. But to judge that some more detail is required. In particular,
> the input/output specifications (also in terms of size and expected
> practical running time) will exclude certain algorithms.

On a dense weighted network of about 1000 nodes, APSP should be run once.


-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <http://lists.ira.uni-karlsruhe.de/pipermail/networkit/attachments/20161213/a27a79f5/attachment.sig>


More information about the NetworKit mailing list