1. A method for traversing a network graph with nodes and edges stored on a distributed network, the method comprising: storing information about a first node in the graph in a first plurality of processors; storing information about east one edge in the graph in a second plurality of processors; identifying, by at least one processor in the first plurality of processors, at least a first edge connected to the first node; and identifying, by at least one processor in the second plurality of processors, at least one other node connected to the first edge.