[OT] Just curious: What's this algorithm's name?

Manfred Nowak svv1999 at hotmail.com
Wed Apr 4 06:42:35 PDT 2012


Nick Sabalausky wrote:

> in cases where the computation stops recursing when it gets back
> to itself 

May be you mean APSP = all pairs shortest path

In your case:
- get rid of all uneven numbered edges
- reverse the remaining edges
- compute APSP, where addition is replaced by concatnation
- details left to the reader

-manfred


More information about the Digitalmars-d mailing list