Open jakobbossek opened 3 years ago
It sucks that grapherator is based on adjacency matrices. Thus, even for sparse graphs with n approaching infinity the required memory explodes.
It sucks that grapherator is based on adjacency matrices. Thus, even for sparse graphs with n approaching infinity the required memory explodes.