igraph

Add function to find all paths between two nodes

Bug #372740 reported by Gábor Csárdi
6
This bug affects 1 person
Affects Status Importance Assigned to Milestone
igraph
Fix Released
Undecided
Tamás Nepusz

Bug Description

Should not be too hard.

Revision history for this message
Tamás Nepusz (ntamas) wrote :

igraph_get_all_shortest_paths now supports a `to` argument (implemented by Gabor). Added some checks to ensure that we don't keep on searching if we reached all the target nodes. This speeds up things a lot if the graph is highly regular (i.e., 100 x 100 lattice and we are looking for a shortest path between node (0, 0) and node (2, 2)).

Changed in igraph:
assignee: nobody → Tamás Nepusz (ntamas)
status: New → Fix Committed
Tamás Nepusz (ntamas)
Changed in igraph:
status: Fix Committed → 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/389

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.