What algorithms for solving the Shortest Paths problem are implemented in BOOST?
13 Jul
2012
13 Jul
'12
5:13 p.m.
I know, Dijkstra's and the Bellman-Ford one are. Is Dial's? http://dl.acm.org/citation.cfm?id=363610 Thanks, Al
13 Jul
13 Jul
6:31 p.m.
New subject: What algorithms for solving the Shortest Paths problem are implemented in BOOST?
On Fri, 13 Jul 2012, Alex Sadovsky wrote:
I know, Dijkstra's and the Bellman-Ford one are. Is Dial's?
I don't think that we have that currently; I don't think we have much specialized to integer-valued weights at all. Contributions are always appreciated, of course, if you or someone else would like to submit one. -- Jeremiah Willcock
4895
Age (days ago)
4895
Last active (days ago)
1 comments
2 participants
participants (2)
-
Alex Sadovsky -
Jeremiah Willcock