Compute the aggregate feerate of a set of nodes in this graph. * * Complexity: O(N) where N=elems.Count(). **/
| 247 | * Complexity: O(N) where N=elems.Count(). |
| 248 | **/ |
| 249 | FeeFrac FeeRate(const SetType& elems) const noexcept |
| 250 | { |
| 251 | FeeFrac ret; |
| 252 | for (auto pos : elems) ret += entries[pos].feerate; |
| 253 | return ret; |
| 254 | } |
| 255 | |
| 256 | /** Get the connected component within the subset "todo" that contains tx (which must be in |
| 257 | * todo). |
no outgoing calls