Additionally common graph based algorithms like path-searches are easy to implement by traversing through the graph.
另外，基于如路径-查询(Path - Search)算法的普通图，也易于通过遍历图来实现。
2
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.