To conduct the benchmark measurement, Koji Ueno of Tokyo Institute of Technology and RIKEN, along with colleagues, used 82,944 of the K computer's 88,128 compute nodes to solve a breadth-first search
of an extremely large graph of 1 trillion nodes and 16 trillion edges in 0.
Search-level control strategy was introduce to integrate the Breadth-First Search
method (BFS) and Depth-First Search method (DFS).
3 Breadth-first Search
algorithm Select start node repeat calculate: diff =quantity - [SIGMA] node if (diff==0) then found solution else for node = 1 .
algorithm always had the second fastest execution times, and the breadth-first search
and Dijkstra's algorithm were the slowest.
Computer scientists ran level-set expansion, and bi-directional, breadth-first search
against the data.