有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
应用推荐