The invention discloses a graph data layout method based on vertex correlation degree. The comprises the following steps: converting graph data into a compressed sparse row structure to obtain a vertex correlation degree array; randomly obtaining initial vertices from the graph data and adding the initial vertices into the initial queue, and adding the initial vertices into a remapping array; adding a neighbor list of vertices in an initial queue to a hierarchical queue; using the vertex correlation degree array to calculate the sum of the vertex correlation degrees between each vertex in thehierarchical queue and all vertices in the sliding window, and adding the vertex with the largest vertex correlation degree array into the remapping array as the best advantage; judging whether all vertices in the hierarchical queue are added into the remapping array, if so, executing the previous step, otherwise executing the next step; emptying the initial queue, adding all the vertices in thehierarchical queue to the initial queue, and emptying the hierarchical queue until the vertex remapping operation is completed to obtain the optimal remapping array. The invention can effectively reduce the random access of the memory and shorten the application execution time for the traversal diagram.