[GAP Forum] shortest paths from s to every vertex of G
David Hobby
hobbyd at newpaltz.edu
Sun Jan 4 02:08:27 GMT 2009
Nicoleta Gramisteanu wrote:
> No . I'm not student .
Sorry. But consider trying references first?
I'd never heard of the algorithm below either,
but found it in a few minutes:
http://en.wikipedia.org/wiki/Bellman-Ford_algorithm
---David
...
> Nicoleta--
>
> Hi. I don't mean to be insulting, but are
> these homework problems?
>
> ---David
>
More information about the Forum
mailing list