directed graph

directed graph的基本解释

-

[计] 有向图

与directed graph相关的网络例句 [注：此内容来源于网络，仅供参考]

The dissertation details the functions and characteristic of curves graph element, polygon graph element, character graph element, dimension graph element, parameter graph element, self-define graph element, and research comprehensively the methods describe and graph element attrib. After discussing the basic graph element collection, this thesis gives the description method, organization way, graph element visitation, save and load efficiency, suitability and so on of every element in the basic graph element collection in greater detail. The author provides a graph element data structure organized version which is length changeable and is a block storage record, and designs a new module of data, which can process both the geometry attrib and no geometry attrib of drawing element. Based on this, the data model of all kind of element is put forward.

对采矿CAD系统中基本图元集的构造原则和组织方法进行了研究，提出了一个7元素采矿CAD基本图元集构造方案；论文详细讨论了曲线图元、字符图元、尺寸标注图元、多边形图元、参数图元、自定义图元在采矿CAD系统中的作用和特点，并对各种图元的表述方法和图元属性及相应的库组织方式、存取效率进行了深入的研究，提出了一个&可变长记录块&图元库结构组织方案；通过对采矿CAD系统中基本图元数据模型的构造方法、存取结构和访问方式的研究，给出了一个用C++语言描述的采矿CAD系统基本图元数据模型及其数据存取结构。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

This paper proposed a transformable model of EWDG (edge-weighted directed graph) and VWDG (vertex-weighted directed graph) to resolve the problem of weighted traversal patterns mining. Based on the model, developed a new algorithm, called LGTWFPMiner (local graph traversals-based weighted frequent patterns miner), and its local estimation of support/weight-hound to discover weighted frequent patterns from the traversals on graph with a level property.

为解决加权遍历模式挖掘问题，首先提出了一种从EWDG到VWDG的变换模型；基于这种模型，提出了在具有层次特性的局部图遍历中，挖掘加权频繁模式的LCTWFPMiner（局部图遍历加权频繁模式挖掘法）及其支持度／权值界的局部评枯方法。

与directed graph相关的网络解释 [注：此内容来源于网络，仅供参考]

directed graph：有向图

这样的外观相当於数学所讲的有向图(directed graph). 成员中的资源可以用来代表全球网上的某资源或没有实质资源的物件,字面数据是用来提供事实资料. 一个资源和另一资源、或字面数据和把它们连在一起的连线可用来陈述一项事实,

directed graph：有向图形

马可夫模式(Markov models)就是基於这样的假设另一方面,所谓完美除错(perfect debugging)是指软体测试人员在修正错并给定其期望使用机率,然后用马可夫链(Markov chain)来表示,且可以有向图形(directed graph)或随机矩阵(stochastic m

directed graph：有向

directable increment sign 方向可変増分符号相関 | directed graph 有向グラフ | directed segment 有向線分

directed graph：定向图

2.154有向图 digraph 30 | 2.155定向图 directed graph 30 | 2.156文档,文件 document 30

block directed graph：块有向图

"方块图模拟器","block diagram simulator" | "块有向图","block directed graph" | "块驱动资料流处理机","block driven data flow processor"