Re: [Boost-users] What algorithms for solving the Shortest Paths problem are implemented in BOOST?

Subject: Re: [Boost-users] What algorithms for solving the Shortest Paths problem are implemented in BOOST?
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-07-13 14:31:35

On Fri, 13 Jul 2012, Alex Sadovsky wrote:

> I know, Dijkstra's and the Bellman-Ford one are.  Is Dial's?  
> 
> http://dl.acm.org/citation.cfm?id=363610

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