utility¶
Utility algorithms¶
This module contains logical and mathematical utility functions used by other MDCraft modules.
Functions
Implements the depth-first search algorithm to find connected components in a graph. |
|
Finds connected components in a graph. |
|
Finds the \(n\) closest factors for a given number \(N\), sorted in ascending order. |
|
Checks if a matrix is lower triangular. |
|
Rebins discrete data. |
|
Replicates points in an unit cell along the \(x\)-, \(y\)-, and \(z\)-directions. |