1) integral directed graph
整有向图
1.
And a new method is obtained,by which some integral directed graphs can be constructed.
通过研究循环图的结构特征与其谱之间的关系,得到循环图是整谱图的条件,并由此获得了一种全新的构造整有向图的方法,可以找到了一些新的整有向图。
2) guassian integral directed graph
高斯整谱有向图
3) Directed Graph
有向图
1.
Grindability Evaluation of Ceramics with Directed Graph of Analytical Grey Incidence Process;
基于灰关联分析的有向图法评价陶瓷材料的磨削加工性
2.
Tolerance modeling approach to part based on directed graph;
基于有向图的零件容差建模方法
3.
Study on directed graph based workflow modeling and running of the model;
基于有向图的工作流建模及其运行
4) digraph
[英]['daiɡrɑ:f] [美]['daɪ,ɡræf]
有向图
1.
Characteristics of generalized Hadamard matrices and corresponding digraphs;
关于广义Hadamard矩阵及其对应有向图类的特征
2.
Recognition method of directed paths in a digraph;
一种有向图中道路的识别方法
5) oriented graph
有向图
1.
The research of assembly sequence of agile fixture elements based on oriented graph;
基于有向图的敏捷夹具元件装配序列研究
2.
This method is first to transfer the locomotive control circuit into the relation oriented graph,then to find all directed paths between two vertexes, and finally to obtain the states of all parts.
在分析机车控制电路的逻辑控制模型基础上，提出将机车控制电路转化为网络的有向图，通过求解有向图中顶点间的单向通路，求得电路中各部件的状态方法，从而自动生成机车控制电路的逻辑控制模型。
3.
To simplify the calculation of the first-arrival time probability density function value in the Markov chain, a matrix portrayal of graph is constructed to show the oriented graph produced which vividly obtain all paths from one condition to another at first time.
为了简化马尔可夫链中首次到达时间概率密度函数值的计算,构造一个图的矩阵表示产生的有向图,形象地得出从一个状态首次到达另一个状态的所有路径。
6) directional graph
有向图
1.
Through analyzing the topology relation of triangle facets of STL model,a directional graph of triangle facets is created,and then a rapid slicing with error-tolerance is obtained by a recursive algorithm.
通过分析STL模型三角形面片之间的邻接关系,建立了有向图,采用递归分层方法实现了具有容错能力的快速分层。
2.
This paper goes into the analysis of program complexity based on directional graph,which analyzes some fac-tors that will affect the number of executive paths,for special,raise the concept of correlation merit,so it can take a little step into the analysis of program complexity through program semantics.
文章对基于有向图的程序复杂度进行了初步的研究,分析了影响程序执行路径数的各个影响因子,特别地,引入了相关指标的概念,从程序语义角度对复杂度做进一步的分析,并且对不同的程序复杂度下选择软件测试路径的策略进行了探讨。
3.
And the coefficients of eigen-polynomial expressions were closely related to the circular sets of a directional graph.
而特征多项式的系数与有向图的圆族有着密切的关系。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条