Now compress in yale sparse format and delete the uncompressed lists
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| type(fmm_tree_type), | intent(inout) | :: | t |
Tree data structure to populate |
||
| real(kind=rp), | intent(in), | optional | :: | min_dist_thr |
Minimum threshold for two nodes to be near, every nodes within this threshold are guaranteed to be near |