Good observation, check my new implementation. As I understand it, Julia's dictionaries are implemented as some kind of balanced binary search tree correct? So this would take O(nnz) to O(log(n)) while still not building the full matrix to conserve space for large graphs...