Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
This article briefly illustrates the concept of graph and searching method.
对图的概念和遍历方法进行了简单的阐述。
A kind of component matching model based on the unordered label tree-inclusion matching and Struct Graph (S-Graph) searching model is proposed. A components management system model is also realized.
提出了基于无序标签树匹配和结构图搜索的组件检索与匹配策略，并实现了一个组件库管理系统模型。
Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
详细地论述了基于邻接表图形数据结构的进路搜索算法，并给出了完整的描述。
It has an operating process which includes graph acquiring, preprocessing, pattern extracting, searching and explaining, graph combining and output.
它有一个包括图形获取、预处理、模式抽取、搜索与解释、图形复合与输出等环节的工作过程。
This problem can be solved through searching in the coalition structure graph or computing directly.
这可以通过在联盟结构图上搜索或直接计算。
First, when the user submits a query media object, the candidate media objects are quickly identified by searching the cross reference graph.
该方法首先通过对网页的预处理，分析其中不同模态媒体对象之间的链接关系，生成交叉参照图。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
A complete database software is a comprehensive engineering software that includes functions such as database searching, maintenance and calculation, graph-drawing and process simulation.
完整的数据库软件是包含数据查询、数据维护、数据计算、图形绘制、以及过程模拟等功能的综合工程软件。
By using Hamilton graph, the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。
Based on the calculated results of finite element method, the problem of slope stability could be converted into searching for the shortest path in graph theory.
基于有限元计算结果，将边坡稳定性问题转化为图论中寻找最短路问题。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
应用推荐