Graph generating method and apparatus

A computer implemented method for reducing computational time and memory consumption of at least one hardware processor generating graph, comprising:

• assigning, by at least one hardware processor, vertices to be processed by a plurality of calculation nodes to the calculation nodes based on the target numbers of edges to generate from a plurality of vertices;
• generating, by a calculation node, a graph in a unit of one source vertex among the vertices, based on a recursive vector to be used repeatedly to generate at least one edge;
• generating, by the calculation node, a graph in a unit of a second source vertex in a case in which a vertex range to be processed by the calculation node exists;
• and
• storing the graph generated in the unit of the source vertex in a case in which the vertex range to be processed by the calculation node does not exist,
• wherein the generating of the graph in the unit of the source vertex comprises generating at least one edge between the source vertex and at least one destination vertex in a scope in which an existence of an edge for the source vertex needs to be verified.

An apparatus for reduced computational time and memory consumption of a hardware processor generating graph, comprising:

• a processor configured to:
• recognize one source vertex among a plurality of vertices,
• obtain the target number of at least one edge to generate from the source vertex, among the total target number of edges to generate between the vertices,
• obtain a recursive vector to be used repeatedly to generate the at least one edge, in a scope in which an existence of an edge for the source vertex needs to be verified, and
• generate the at least one edge between the source vertex and at least one destination vertex based on the target number and the recursive vector,
• wherein the scope is determined based on the number of the vertices.

An apparatus for reduced computational time and memory consumption of a hardware processor generating graph, comprising:

• a controller configured to assign vertices to be processed by a plurality of calculation nodes to the calculation nodes based on the target numbers of edges to generate from a plurality of vertices;
• and
• a calculation node configured to:
• generate a graph in a unit of one source vertex among the vertices, based on a recursive vector to be used repeatedly to generate at least one edge,
• generate a graph in a unit of a second source vertex in a case in which a vertex range to be processed exists, and
• store the graph generated in the unit of the source vertex in a case in which the vertex range to be processed does not exist,
• wherein the calculation node generate at least one edge between the source vertex and at least one destination vertex in a scope in which an existence of an edge for the source vertex needs to be verified.