6. The method of claim 1 , further comprising: storing the particular graph, wherein storing the particular graph comprises: storing a node array that identifies each node in the particular graph; storing a neighbor array that identifies, for each node in the particular graph, zero or more nodes that are connected to said each node; wherein at least one node in the particular graph is connected to multiple nodes.
6. The method of claim 1 , further comprising: storing the particular graph, wherein storing the particular graph comprises: storing a node array that identifies each node in the particular graph; storing a neighbor array that identifies, for each node in the particular graph, zero or more nodes that are connected to said each node; wherein at least one node in the particular graph is connected to multiple nodes. 8. The method of claim 6 , wherein: storing the particular graph comprises storing an edge attribute array that indicates, for each edge in the particular graph, zero or more attributes or properties of said each edge; at least one entry in the edge attribute array indicates one or more attributes of a corresponding edge in the particular graph.