There should be a way to get all the shortest paths of equal length

NetLogo / NW-Extension

This is the NetLogo Network Extension. For general information about NetLogo, see:

http://ccl.northwestern.edu/netlogo/

Other

60 stars 26 forks source link

There should be a way to get all the shortest paths of equal length #52

Open nicolaspayette opened 12 years ago

nicolaspayette commented 12 years ago

Currently, all the "path-to" primitives return the first path that Jung's implementation of Dijktra's algorithm finds.

Maybe there should even be a way to get all the acyclic paths from A to B. (You could then order them by length if you want to.)

arthurhjorth commented 11 years ago

This would be super helpful. By being able to randomly choose between 'reasonably short' paths, we can model imperfect information in networks. I guess it'd be sort of network stochasticity.

nicolaspayette commented 11 years ago

Maybe use http://jgrapht.org/javadoc/org/jgrapht/alg/KShortestPaths.html

jlambvo commented 6 months ago

I'm running into this limitation right now. Is there any way to force nw to report all shortest paths?