igraph

Add a 'to' argument to shortest paths calculation

Bug #293537 reported by Gábor Csárdi
2
Affects Status Importance Assigned to Milestone
igraph
Fix Released
High
Gábor Csárdi

Bug Description

The two things we gain are: 1) we can stop the algorithm as soon as all vertices in 'to' are reached and 2) we can allocate a smaller matrix, less memory is needed for the computation, compared to calculating shortest paths to all vertices and then taking the relevant subset.

Revision history for this message
Gábor Csárdi (gabor.csardi) wrote :

It is quite some work to do this for both the weighted and the unweighted case...

Changed in igraph:
assignee: nobody → gabor.csardi
importance: Undecided → High
status: New → Confirmed
Revision history for this message
Gábor Csárdi (gabor.csardi) wrote :

Done.

Changed in igraph:
status: Confirmed → Fix Released
Revision history for this message
Gábor Csárdi (gabor.csardi) wrote : Continue on github

The development of igraph has moved to github, so please do not comment on this bug here. You are of course welcome to comment on github, here:
https://github.com/igraph/igraph/issues/24

To post a comment you must log in.
This report contains Public information  
Everyone can see this information.
Subscribing...

Other bug subscribers

Remote bug watches

Bug watches keep track of this bug in other bug trackers.