A graph data processing method in a distributed system, wherein the distributed system comprising a master node and a plurality of worker nodes, comprising: obtaining, by the master node, graph data, wherein the graph data comprises M vertexes and a plurality of directional edges, each edge connects two of the M vertexes, a direction of each edge is from a source vertex to a destination vertex in the two vertexes, and M is an integer greater than two; and dividing, by the master node, the graph data, into P shards, wherein each shard comprises an incoming edge of at least one target vertex, the incoming edge is an edge directed to the target vertex, a sum of quantities of target vertexes corresponding to the P shards is equal to M, the target vertices corresponding to each shard are different, P is a positive integer greater than 1, and the P shards comprise a first shard and a second shard, characterized by: determining, by the master node, at least two edge sets from each shard, wherein the edge sets are determined according to at least one source vertex; and scheduling (104, 105), by the master node to at least two of the worker nodes for processing, at least two edge sets comprised in the first shard and an associate edge set comprised in the second shard, wherein the associate edge set is an edge set that comprises an outgoing edge of a target vertex corresponding to the first shard, and the outgoing edge is an edge directed from the target vertex in the first shard. obtaining, by the master node, graph data, wherein the graph data comprises M vertexes and a plurality of directional edges, each edge connects two of the M vertexes, a direction of each edge is from a source vertex to a destination vertex in the two vertexes, and M is an integer greater than two; and dividing, by the master node, the graph data, into P shards, wherein each shard comprises an incoming edge of at least one target vertex, the incoming edge is an edge directed to the target vertex, a sum of quantities of target vertexes corresponding to the P shards is equal to M, the target vertices corresponding to each shard are different, P is a positive integer greater than 1, and the P shards comprise a first shard and a second shard, characterized by: determining, by the master node, at least two edge sets from each shard, wherein the edge sets are determined according to at least one source vertex; and scheduling (104, 105), by the master node to at least two of the worker nodes for processing, at least two edge sets comprised in the first shard and an associate edge set comprised in the second shard, wherein the associate edge set is an edge set that comprises an outgoing edge of a target vertex corresponding to the first shard, and the outgoing edge is an edge directed from the target vertex in the first shard. determining, by the master node, at least two edge sets from each shard, wherein the edge sets are determined according to at least one source vertex; and scheduling (104, 105), by the master node to at least two of the worker nodes for processing, at least two edge sets comprised in the first shard and an associate edge set comprised in the second shard, wherein the associate edge set is an edge set that comprises an outgoing edge of a target vertex corresponding to the first shard, and the outgoing edge is an edge directed from the target vertex in the first shard.