Hi Venkata!
2012/9/25 Venkata Sastry Malladi :
> Thanks for the reply, Sebastian.
>
> The problem I'm working on is a routing algorithm for a country wide railway
> network. I was thinking about two ways to approach it.
How many vertices and edges do you have? Seems of reasonable size...
> 1. Pr
a new destination.
On Tue, Sep 25, 2012 at 1:25 AM, Sebastian Schelter wrote:
> Hi Venkata,
>
> The result of All-Pairs-Shortest-Paths is quadratic in the number of
> vertices which makes it infeasible for sufficiently large graphs.
>
> Best,
> Sebastian
>
>
>
Hi Venkata,
The result of All-Pairs-Shortest-Paths is quadratic in the number of
vertices which makes it infeasible for sufficiently large graphs.
Best,
Sebastian
On 24.09.2012 20:24, Venkata Sastry Malladi wrote:
> I'm thinking of modifying the simple shortest paths algorithm so
