| 1. | Another matrix associated with g is the adjacency matrix . 伴随于G的另一个矩阵是邻接矩阵。 |
| 2. | Establish the adjacency relation among all pairs of components which share a pair of pseudovertices . 在所有共享一对伪顶点的二个分量间建立相邻关系。 |
| 3. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency . 如果在两个图之间存在一个保持邻接性的1-1对应,则这两个图是同构的。 |
| 4. | Generates adjacency information based on mesh indices 基于网格索引生成邻接信息。 |
| 5. | How the publishing houses of u . s . carry out adjacency right 美国出版社怎样进行邻接权交易 |
| 6. | Another matrix associated with g is the adjacency matrix 伴随于g的另一个矩阵是邻接矩阵。 |
| 7. | The connectivities of the adjacency leaf exchange forest graphs 邻接叶边交换森林图的连通性 |
| 8. | Converts point representative data to mesh adjacency information 将点表示形式的数据转换为网格邻接信息。 |
| 9. | Converts mesh adjacency information to an array of point representatives 将网格邻接信息转换为点表示形式的数组。 |
| 10. | So the storage structure of finite automaton should the choosed adjacency lists 所以,有穷自动机的存储结构最好采用邻接链表来存储。 |