stanford-ppl/Green-Marl — pull request #82 by janlugt (2012-09-05 23:45:30+00:00)
Title: implemented adjacency list reader in gm_graph

It's about 13 times as slow as the binary reader. Still a lot faster than converting the adjacency list to a binary and then reading the binary, probably.