查询词典 undirected graph
- 与 undirected graph 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
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
-
The problem of deciding whether an arbitrary undirected planar graph $G$ is a Hamiltonian is one of six best important {bf NP}-complete problems.
判定一个任意的无向可平面图G是否是哈密顿图问题是六个重要的NP完全问题之一。
-
In this thesis, we consider only finite, undirected and simple graph G = of order n.
在这篇论文中,我们只考虑阶数为n的有限,无向简单图G=。
-
Secondly, a more general linear controller isdesigned. The method based on frequency domain theory is suitable to both cases of undirected and directed graph.
在第二种方法中,所设计的控制器为一般的线性控制器,结论同时适用于有向和无向图两种情形。
-
Let G be an undirected, simple and connected graph.
最小限制边割所含的边数称为G的限制边连通度(有向图的限制边连通度可类似给出)。
-
Markov network is an undirected graph, it could be the uncertainty of knowledge, reasoning, No words can explain to the edge between relevance, through Markov network learning mechanism words of relevant information.
Markov网络是一个无向图,它可进行不确定性的知识推理,无向边可解释词间相关性,通过Markov网络学习机制获得词的相关信息。
-
Then the adjoint circuit model of an undirected graph isestablished.
给出了无向图的伴随电路模型。
-
Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
详细说明:回溯法解决TSP问题,对于任何的无向图,只要存在回路均可找到,无回路也可检测出来!
-
In this thesis we also have investigated how to identify the most reliable routing and developed an algorithm which is able to identify all paths between nodes of undirected graph----Adjacent Matrix Algorithm .
因此本文研究了如何确定通信网中最可靠路由问题,提出了确定无向图中任意两点间的所有路径的一种算法——邻接矩阵法。
- 推荐网络例句
-
However, as the name(read-only memory)implies, CD disks cannot be written onorchanged in any way.
然而,正如其名字所指出的那样,CD盘不能写,也不能用任何方式改变其内容。
-
Galvanizes steel pallet is mainly export which suits standard packing of European Union, the North America. galvanizes steel pallet is suitable to heavy rack. Pallet surface can design plate type, corrugated and the gap form, satisfies the different requirements.
镀锌钢托盘多用于出口,替代木托盘,免薰蒸,符合欧盟、北美各国对出口货物包装材料的法令要求;喷涂钢托盘适用于重载上货架之用,托盘表面根据需要制作成平板状、波纹状及间隔形式,满足不同的使用要求。
-
A single payment file can be uploaded from an ERP system to effect all pan-China RMB payments and overseas payments in all currencies.
付款指令文件可从您的 ERP 系统上传到我们的电子银行系统来只是国内及对海外各种币种付款。