directed graph相关的网络例句

查询词典 directed graph

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

The main points of this paper are as follows:(1) The actuality and the deficiency of the current workflow technology is analyzed according to the expatiating on the workflow technology.(2) A workflow model supporting the dynamic modifying and its implementation arithmetic and an implementation method using the OO technology is proposed according to the Directed Graph theory.(3) The strategy of dynamic modifying of workflow model is researched, a improved conversion strategy is proposed, and the detailed process of dynamic modifying is discussed.(4) Having researched on the construction scheme of digital campus based on URP and the workflow of office business, an OA system model based on dynamic workflow technology was proposed according to the workflow management system model and several typical functions of OA workflow management system were realized, which is of high value on improving the autoimmunization of business operation and the cooperating work ability.

论文的主要内容如下：(1)通过对工作流技术的全面阐述，分析了目前工作流技术发展的现状和不足，为自己的研究工作划定了问题域范围；(2)利用有向图定义了一个支持动态修改的工作流模型，并给出了该模型的执行算法，给出了该模型利用面向对象技术的一种实现方法；(3)详细讨论了工作流模型的修改策略和方法，提出了一种改进了的转换策略，并给出了动态修改操作的具体步骤；(4)在深入分析基于URP的数字校园建设方案以及办公工作流程的基础上，结合工作流管理系统参考模型，提出了基于动态工作流技术的OA系统模型，实现了OA工作流管理系统中几个典型的功能，对提高业务处理自动化，提高协同工作能力具有重要的应用价值。

Let G be a finite group, and S a subset of G not containing theidentity element 1. The Cayley digraph Cay on G with respect to S is definedas a directed graph with vertex set G and edge set {|g∈G, s∈S}. IfS~(-1)=S, then Cay is undirected and in this case, we view two directededges and as an undirected edge {u, v}. Obviously, the right regularrepresentation R of G, the acting group of G by right multiplication, is asubgroup of the full automorphism group AutCay(G, S of Cay.

给定有限群G，设S是G的不含单位元1的子集，群G关于子集S的Cayley有向图Cay是一个以G顶点集合，而以｛|g∈G，s∈S｝为边集合的有向图，特别地，若S~(-1)=S，则X=Cay是无向的，此时我们把一条无向边｛u，v｝等同于两条有向边和，易见，群G的右正则表示R，即G在G上的右乘作用，为图Cay的全自同构群AutCay

TSP is brought forward and is transformed into shortest closed Hamilton loop of directed graph problem.Then three kind of algorithms of TSP is indroduced.

首先提出旅行商问题，并将其转化为最短有向图哈密尔顿回路问题，然后介绍了三种类型的求解TSP的算法。

Recursive algorithm for a directed graph strongly connected component, the input format such as compression packag...

递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。

Second, mapping rules used to convert call-based connectors into component the connection directed graph are proposed.

隐式硬编码的基于过程调用构件连接束缚构件集成的灵活性，且存在的死锁连接造成软件可靠性隐患问题。

Based on rooted connected directed graph both cyclic and acyclic, OIM can describe the relationship of a complex object and its component objects, as well as the links between HTML files in World-Wide-Web naturally.

它基于带根连通有向图，图中可出现环路，因而能自然地描述复杂对象与其成员对象间的引用关系和WWW上HTML文件间的链接关系。

We shall abbreviate 'directed graph'to digraph.

我们将把"有方向的图"简称为方向图。

A graph is directed a digraph if each edge links two nodes together only in one direction .

如果每条边线仅在一个反向上将两个结点连接起来，则该图为有向图。

A new model of this kind based on Markov model and directed graph is put forward in this paper.

结合马尔科夫模型和有向图特点，提出了一种新的建模方式。

According to the results, a directed graph will be constructed to build a Bayesian Belief Network.

根据这样的结果，可以建构出一个有方向性的图形，而这个图形可以建构成一个所谓的贝氏认知网路。