> 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...
>
Julia's dictionaries are just a hash table, no binary trees.  O(1), with a
large constant.