undigraph
常见例句
- The algorithm is very simple and suitable for finding all undirected Hamiltonian circuits in general undigraph.
算法简便,适合于求解一般无向图中全部哈密顿回路。 - Based on analyzing existed structures of undigraph and characteristics of 2D drawing, Classified Adjacency List which is an improving structure of undigraph is presented.
在充分分析现有无向图存储结构优缺点的基础上,结合二维工程图形的特点,提出了一种改进的无向图存储结构——分类邻接表存储结构。 - To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
为了求解上述模型,首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度,然后设计了捕食搜索算法对模型进行求解。 返回 undigraph