We identify the graph data structure, frontiers, operators, an iterative loop structure, and convergence conditions as essential components of graph analytics systems based on the native-graph approach. Using these essential components, we propose an abstraction that captures all the significant programming models within graph analytics, such as bulk-synchronous, asynchronous, shared-memory, message-passing, and push vs. pull traversals. Finally, we demonstrate the power of our abstraction with an elegant modern C++ implementation of single-source shortest path and its required components.

翻译：我们把图表数据结构、边界、操作员、迭接环路结构以及汇合条件确定为基于本地绘图方法的图形分析系统的基本组成部分。我们利用这些基本组成部分,提出一个抽象概念,将图解分析中的所有重要编程模型都包括在内,例如散装同步、无同步、共享存储、信息传递和推车与拉动横跨。最后,我们展示了我们抽象的能量,用优雅的现代C++ 实施单一源最短路径及其所需组成部分。