The complexity of loadCSV1D is O(N^2), where N is the number of columns per row. In the case where we have a large CSV array, e.g., adjacency matrices in csr format, if we have a 1-line array, loadCSV1D will take a long time to run. I will revisit our strategy for generating the host cpp and make a patch.
The complexity of loadCSV1D is O(N^2), where N is the number of columns per row. In the case where we have a large CSV array, e.g., adjacency matrices in csr format, if we have a 1-line array, loadCSV1D will take a long time to run. I will revisit our strategy for generating the host cpp and make a patch.