Data structure that holds a transaction graph's preprocessed data (fee, size, ancestors, descendants).
Synopsis
Declared in <cluster_linearize.h>
template<typename SetType>
class DepGraph;Member Functions
Name |
Description |
|
Constructors |
Assignment operators |
|
Modify this transaction graph, adding multiple parents to a specified child. |
|
Add a new unconnected transaction to this transaction graph (in the first available position), and return its DepGraphIndex. |
|
Get the ancestors of a given transaction i. Complexity: O(1). |
|
Append the entries of select to list in a topologically valid order. |
|
Reduce memory usage if possible. No observable effect. |
|
Count the total number of reduced (direct) dependencies in the graph. |
|
Get the descendants of a given transaction i. Complexity: O(1). |
|
Report the heap memory used by this graph. |
|
|
|
Find some connected component within the subset "todo" of this graph. |
|
Get the connected component within the subset "todo" that contains tx (which must be in todo). |
|
Compute the (reduced) set of children of node i in this graph. |
|
Compute the (reduced) set of parents of node i in this graph. |
|
Check if this graph is acyclic. |
|
|
|
Get the range of positions in this DepGraph. All entries in Positions() are in [0, PositionRange() ‐ 1]. |
|
Get the set of transactions positions in use. Complexity: O(1). |
|
Remove the specified positions from this DepGraph. |
|
Get the number of transactions in the graph. Complexity: O(1). |
Friends
Name |
Description |
Equality operator (primarily for testing purposes). |
Non-Member Functions
Name |
Description |
Compute the feerates of the chunks of linearization. Identical to ChunkLinearizationInfo, but only returns the chunk feerates, not the corresponding transaction sets. |
|
Compute the chunks of linearization as SetInfos. |
|
Find or improve a linearization for a cluster. |
|
Improve a given linearization. |
Created with MrDocs