If the number of nodes in a channel is smaller or equal than the
requested degree, a fully connected graph is used. For n>d, a random
d-regular graph is set up. (For n=d+1, the two are the same.)
Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
Treat send in block proposer as in validators to simplify
code and fix steps. Previously first step included first two
timelots: initial send by block proposer and first send by
validators.
Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
Keeps track of sent and received samples per line per neighbor.
Only send what wasn't yet sent or wasn't received from the other side.
Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
