5. The method according to claim 1 , wherein determining the partition number and the layer number of the candidate vertex indicated by the query condition comprises: determining, based on the partition number and the layer number of the query vertex and according to a distance between the candidate vertex indicated by the query condition and the query vertex, the partition number and the layer number of the candidate vertex.
5. The method according to claim 1 , wherein determining the partition number and the layer number of the candidate vertex indicated by the query condition comprises: determining, based on the partition number and the layer number of the query vertex and according to a distance between the candidate vertex indicated by the query condition and the query vertex, the partition number and the layer number of the candidate vertex. 7. The method according to claim 5 , wherein vertex-cut partitioning is performed on the multiple vertices in the graph data whole set; a partition border comprises a vertex; and a shortest distance between the vertex on the partition border and the partition border of a partition in which the vertex is located is zero; and wherein the query condition indicates a maximum distance between the candidate vertex and the query vertex; when the maximum distance is not greater than the layer number of the query vertex, determining the partition number and the layer number of the candidate vertex comprises: determining that the partition number of the candidate vertex is the partition number of the query vertex; determining a minimum value between a maximum layer number in a partition in which the query vertex is located and a value obtained by adding the layer number of the query vertex and the maximum distance; and determining a layer number within a closed interval from a value obtained by subtracting the maximum distance from the layer number of the query vertex to the minimum value as the layer number of the candidate vertex; when the maximum distance is greater than the layer number of the query vertex, the determining a partition number and a layer number of the candidate vertex specifically comprises: determining that the partition number of the candidate vertex is the partition number of the query vertex and a partition number of a neighboring partition of a partition in which the query vertex is located; for the partition in which the query vertex is located, determining a minimum value between a maximum layer number in the partition in which the query vertex is located and a value obtained by adding the layer number of the query vertex and the maximum distance, and determining a layer number within a closed interval from zero to the minimum value as the layer number that is of the candidate vertex and that belongs to a same group as the partition number of the query vertex; and for each neighboring partition of the partition in which the query vertex is located, determining a minimum value between a maximum layer number of the neighboring partition and a value obtained by subtracting the layer number of the query vertex from the maximum distance, and determining a layer number within a closed interval from zero to the minimum value as the layer number that is of the candidate vertex and that belongs to a same group as a partition number of the neighboring partition.