1) ergodic optimization
遍历寻优
2) Non-ergodic optimization
非遍历寻优
3) exhaustive searching
遍历搜寻问题
1.
An introduction about the basis and fulfilment of quantum Grover algorithm is provided,as well as its application in exhaustive searching.
介绍了量子Grover 算法的原理与实现,以及它在遍历搜寻问题中的应用;从中可以看出量子算法相对于传统算法的优越
4) Breadth first search
广度优先遍历
1.
Based on the breadth first search,the paper proposed a new sufficient condition of Bigraph which is easy to be implemented.
利用图的广度优先遍历,提出了一个易于实现的二部图判定的充要条件:无向图G是二部图当且仅当G的广度优先生成森林中的同一层上的任意两点在G中不邻接。
6) depth-first traversal
深度优先遍历
1.
Edge recognition method for image segmentation based on depth-first traversal;
基于深度优先遍历的图像边缘检测方法
补充资料：遍历
1.普遍游历。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条