http://idk.i2p/javadoc-i2p/net/i2p/kademlia/class-use/KBucketSet.html
(package private) List < Hash > FloodfillPeerSelector. selectMostReliablePeers ( Hash key,
int maxNumRouters, Set < Hash > peersToIgnore, KBucketSet < Hash > kbuckets) Pick out peers with the floodfill capacity set, returning them first, but then
after they're complete, sort via kademlia. (package private) List < Hash > PeerSelector. selectMostReliablePeers ( Hash key,
int numClosest, Set < Hash > alreadyChecked, KBucketSet < Hash > kbuckets) UNUSED - See FloodfillPeerSelector...