# tree_d_3d.kernels.dual_traverse.dual_traverse_numpy

*module*

The version of the ``dual_traverse`` kernel for machines without Pyccel.

The traversal of ``dual_traverse_pyccel.py`` breadth first instead of depth first,
vectorized over the pairs of a generation: the same M2L and P2P pairs, in another
order (which only changes the order of the sums that use them).

[View source](https://github.com/max-models/tree-d-3d/blob/devel/src/tree_d_3d/kernels/dual_traverse/dual_traverse_numpy.py#L1-L1)

## tree_d_3d.kernels.dual_traverse.dual_traverse_numpy.dual_traverse

*function*

```python
def dual_traverse(t_center, t_half, t_start, t_end, t_child, s_center, s_half, s_start, s_end, s_child, theta, stack, m2l, p2p, counts)
```

Pairs (target cell, source cell) from (root, root): see ``dual_traverse_pyccel``.

``stack`` is unused.

[View source](https://github.com/max-models/tree-d-3d/blob/devel/src/tree_d_3d/kernels/dual_traverse/dual_traverse_numpy.py#L23-L67)
