Zooko: Thanks for the explanation! Daira: I found the wikipedia page useful but I didn't find the explanation sufficient enough for me because I haven't done a lot of work with graphs outside of Dijkstra algorithm for shortest paths. I will look at the book Zooko recommended and follow up with you and Kevan if I have any questions.
For future reference, I've created a branch for this project on my github account here: https://github.com/markberger/tahoe-lafs/tree/1382-immutable-peer-selection Thanks, Mark Berger On Sun, Jun 16, 2013 at 6:12 PM, Zooko O'Whielacronx <zoo...@gmail.com>wrote: > I think the "Introduction to Algorithms" has a succinct description of > Edmonds-Karp: > > https://en.wikipedia.org/wiki/Introduction_to_Algorithms > > Regards, > > Zooko > _______________________________________________ > tahoe-dev mailing list > tahoe-dev@tahoe-lafs.org > https://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev >
_______________________________________________ tahoe-dev mailing list tahoe-dev@tahoe-lafs.org https://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev
