[algogeeks] comparison of djikstra, prim and kruskal

Hello, Can anybody clarify my following doubts. 1. For what graphs will the output of djikstra, prim and kruskal remain same? 2. Is the output of djikstra and prim (output graph excluding weights) same? 3. Will negative weights have impact on prims and kruskals? 4. under what conditions the mst

[algogeeks] Re: Finding common elements

You need a large enough hash table to avoid collisions. 5 is a small number so the hash table shouldn't be too large. This hashing function can even depend on how your coordinates look like. If they are all integers, you could come up with some simpler hash fn which guarantees no collisions.

[algogeeks] Friend-machines-assisted approach to downloading via BitTorrent

I have an idea about boosting one's downloading in a swarm: Suppose I have several friends whose machines are often idle when I want to download something via a torrent. These friend machines have quite good broadband connection speed with my machine. Because of some agreement between us, they al

[algogeeks] Anything else you know about the book for Randomized Algorithms

I just ever know something about Randomized Algorithm, and I don't know what better kind of books for which I will learn is. Could any body say something about the books, which are written for Randomized Algorithm. My friend say the book as follow will suitable for me to learn by myself. But I t