# Refinement

> USearch for Wolfram

`DenseRefine[receiver]` re-links the graph and answers how many nodes had their neighbors changed, taking `"ExpansionFactor"` like the other walks.
It is what makes the entries `DenseHealth` finds unreachable searchable again.

`Needs["USearch`"]`

## DenseRefine

`DenseRefine[receiver]` re-selects the neighbors of every stored entry against the finished graph, improving those chosen while the graph around them was incomplete.

```mathematica
DenseRefine[receiver, OptionsPattern[]]
```

"ExpansionFactor" sets the breadth of the candidates the walk explores, 0 deriving it.

- `"ExpansionFactor"`: Default: `0`