Method and device for complex graph processing

Provided in the embodiment of the present invention are a method and device for complex graph processing, realizing a reduction of overheads during a computing process and applying to a plurality of graph algorithms. The method comprises: deleting a first vertex in a complex graph as well as a side of a neighboring point of the first vertex connected with the first vertex, to obtain a first new graph; adding the weight of the first vertex and the weight of the neighboring point of the first vertex in the complex graph together, to obtain the weight of the neighboring point of the first vertex in the first new graph; and in case of determining that the number of the vertices of the first new graph does not exceed a preset threshold, the first new graph is used as a simple graph equivalent to the complex graph.