本文为您带来无向的英文翻译，包括无向用英语怎么说，无向用英语怎么说，无向的英语造句，无向的英文原声例

本文为您带来无向的英文翻译，包括无向用英语怎么说，无向用英语怎么说，无向的英语造句，无向的英文原声例句，无向的相关英语短语等内容。

无向的英文翻译，无向的英语怎么说？

无向的英语网络释义

无向的汉英大词典

无向的英语短语

无向的英文例句

无向图dot语言语法生成。

Undirected graph dot language-syntax generation.

将广播网络用简单连通的无向图表示。

Broadcast networks can be expressed by a simple connected undirected graph.

然后提出了一种基于加权无向图的控制方法。

And then the control method based on weighted graph was presented.

一广义圈是一无向图，其顶点次数都是非零偶数。

A circ is an undirected graph having only vertices of even nonzero degree.

综述无向简单图零度问题近年来所取得的研究进展。

This paper gave a review of recent developments in the study of nullities of undirected simple graphs.

分别对无向图和混合图这两类图进行了进一步研究。

This thesis presents a systematic research on two types of graphs, that is undirected graph and mixed graph.

算法简便，适合于求解一般无向图中全部哈密顿回路。

The algorithm is very simple and suitable for finding all undirected Hamiltonian circuits in general undigraph.

对于一棵无向树，我们可以选择它的任意节点作为根。

For a undirected graph with tree characteristics, we can choose any node as the root.

最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。

Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.

求无向图的生成树是在网络和回路分析中经常遇到的重要问题。

To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle.

拍照前先确定一下光源，它是硬的还是软的，是无向的还是有向的。

Look for the light and what it's doing in each of your images. Is it hard or soft, defuse or directional?

根据实验电路图抽象出信号传播无向图，建立系统的信号传播机制。

The signal in system is transmitted by the undirected graph which is abstracted from experiment circuit diagram.

它支持有向或无向的模型，离散或连续的变量，各种推论及学习算法。

It supports directed and undirected models, discrete and continuous variables, various inference and learning algorithms.

本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。

In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.

给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。

In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.

本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。

The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.

给定一个无向图，编写函数找出所有的最小高度树，并返回其根标号的列表。

Given such a graph, write a function to find all the MHTs and return a list of their root labels.

条件随机场是一种无向图模型，它具有产生式模型和最大熵马尔可夫模型的优点。

Conditional Random Fields (CRF) is arbitrary undirected graphical model that bring together the best of generative models and Maximum Entropy Markov models (MEMM).

从一实例分析出发，推导出一般线性目标规划数学模型的多重解结构为一无向图。

From the analysis of a practical example, the article derives that the poly-solution structure of the maths model of the general linear goal programming is an undirected graph.

本文给出既含无向边又含有向边混合单触点开关网络的拓扑分析与综合的直接方法。

This paper gives the direct approaches for topological analysis and synthesis of hybrid single contact switching networks which contain both undirected and directed edges.

将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。

The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

对于无向基因组的重组排序问题，重组排序操作只改变基因序列，不会改变基因的符号。

For the problem of sorting signed genomes, a sorting operation can change both the gene sequence and the signs of genes.

将该方案与无向传递签名方案结合，提出一个可对任何有向二元传递关系进行签名的方案。

A solution for signing any directed transitive binary relation is presented by combining the proposed scheme with the undirected transitive signature schemes available.

该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。

The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.

无向的原声例句

无向的网络释义

很抱歉，暂无字的网络释义。

以上关于无向的英语翻译来自英汉大词典，希望对您学习无向的英语有帮助。