utility¶
Utility algorithms¶
This module contains logical and mathematical utility functions used by other MDHelper modules.
Functions
Implements the depth-first search algorithm to find connected components in a graph. |
|
Finds connected components in a graph. |
|
Get the \(n\) closest factors for a given number \(N\), sorted in ascending order. |
|
Rebin discrete data. |
|
Replicate point(s) in an unit cell along the \(x\)-, \(y\)-, and \(z\)-directions. |