Fri Mar 3 09:22:44 PST 2006
- Previous message: [Slony1-general] Listen path generation and bug 1485
- Next message: [Slony1-general] Listen path generation and bug 1485
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
> Dijkstra's algorithm does that in O(n^2) time, and we would have to do > this for n origins and (n-1) receivers. > > Thus, worst case should be O(n^4). I did not fully track the discussion, but for all-pair shortest path one may use http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm Greetings Marcin Mank
- Previous message: [Slony1-general] Listen path generation and bug 1485
- Next message: [Slony1-general] Listen path generation and bug 1485
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Slony1-general mailing list