Connected components: 1. find N most recent transactions

iotaledger / cliri

Coo Less IRI

Other

24 stars 8 forks source link

Closed alon-e closed 5 years ago

alon-e commented 5 years ago

related to: #86 focusing on 2. ii. in this issue.

the following functionality is needed: given a list of recent tips M, find the N most recent transactions.

this will be implemented using a max heap sorted by arrivalTime.
the heap is initialized with the tips.
each round max is popped, added to result, and it's 2 children added to the heap (sorted by arrivalTime).
repeat until N transactions have been popped.

alon-e commented 5 years ago

priority queues are linear for contains(), use result set to avoid adding an already visited node to the heap.