Classic graphs are very basic generators that can turn any random point cloud into a nicely interconnected structure.
Delaunay & Voronoi are two of the most popular algorithms to achieve that; as they offer the benefit of interesting & useful properties.
Note that the 3D version of those generators requires the points to NOT be coplanar for the maths to work – you’ll be prompted to use the 2D version otherwise.
