| 摘要 |
In one implementation, graph traversal method identifies a quantity of nodes within a graph, traverses a portion of the graph, and aborts traversal of the graph in response to a determination that a node-access counter satisfies a condition relative to the quantity of nodes within the graph. At least one edge of the graph is not considered during traversal of the graph. |
