Skip to main content
. Author manuscript; available in PMC: 2017 Mar 22.
Published in final edited form as: ACM Trans Intell Syst Technol. 2016 Oct 3;8(1):1. doi: 10.1145/2898361

Fig. 2.

Fig. 2

A diagram of graph data structures in SNAP. Node ids are stored in a hash table, and each node has one or two associated vectors of neighboring node or edge ids.