Zooko: Thanks for the explanation!<div><br></div><div>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.</div>
<div><br></div><div>For future reference, I've created a branch for this project on my github account here: <a href="https://github.com/markberger/tahoe-lafs/tree/1382-immutable-peer-selection">https://github.com/markberger/tahoe-lafs/tree/1382-immutable-peer-selection</a></div>
<div><br></div><div>Thanks,</div><div>Mark Berger</div><div><br><div class="gmail_quote">On Sun, Jun 16, 2013 at 6:12 PM, Zooko O'Whielacronx <span dir="ltr"><<a href="mailto:zookog@gmail.com" target="_blank">zookog@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">I think the "Introduction to Algorithms" has a succinct description of<br>
Edmonds-Karp:<br>
<br>
<a href="https://en.wikipedia.org/wiki/Introduction_to_Algorithms" target="_blank">https://en.wikipedia.org/wiki/Introduction_to_Algorithms</a><br>
<br>
Regards,<br>
<br>
Zooko<br>
<div class="HOEnZb"><div class="h5">_______________________________________________<br>
tahoe-dev mailing list<br>
<a href="mailto:tahoe-dev@tahoe-lafs.org">tahoe-dev@tahoe-lafs.org</a><br>
<a href="https://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev" target="_blank">https://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev</a><br>
</div></div></blockquote></div><br></div>