graph: make FindEligibleCritical() more deterministic to reduce snowball conflicts by finding an eligible critical transaction from the bottom up
@@ -330,7 +330,7 @@ func (g *Graph) FindEligibleCritical(difficulty byte) *Transaction {
g.Lock()
- g.seedIndex.Descend(func(i btree.Item) bool {
+ g.seedIndex.Ascend(func(i btree.Item) bool {
tx := i.(*sortBySeedTX)
if tx.Depth <= g.rootDepth {
