大家在查：小范畴上极限完全格完全偏序可导性线性泛函依测度收敛正规族普里瓦洛夫解析函数边界性质

无向图

网络undirected graph; Undigraph; graph g

无向图

网络释义

无向图

undirected graph

一个无向图(undirected graph)是一个二元组，其中：1.V是非空集合，称为顶点集。

Undigraph

无向图：若图 G 中的每条边都是没有方向的，则称 G 为无向图 (Undigraph)。混合图：既有有向边，也有无向边的图完全图： …

graph g

　　10、已知用邻接矩阵表示的无向图（graph g ），编写算法：统计该图g 的边数。　　11、某一机器中有n 个零件。

non oriented graph

数学专业英... ... non negative semidefinite matrix 非负半正定阵 non oriented graph 无向图 non parametric test 无分布检验 ...

Indirected grath

不确定理论论坛 Uncertainty Theory... ... 连通图 Intorconmunicating grath 无向图 Indirected grath 有向图 Directed grath ...

directionless graph

什么意思... ... direct 管理；指挥；导演；指向 directionless graph 无向图 directionless pressure 无定向压力 ; 静压力 ...

unconnected graph

22 树状结构（tree）可视为一具有相连（connected）且无回路（acyclic）的无向图（unconnected graph）。在下列关於树状 …

markov random filed

概率图分为有向图（bayesian network）与无向图（markov random filed）。直觉上说，有向图突出causality（因果关系，其实 …

例句：

map storage structure definition and graph types to create graph : directed graph, undirected graph, to the network without the network .

图的存储结构的定义和图的创建图的种类有：有向图、无向图、有向网、无向网。

using adjacency list undirected graph storage to achieve the breadth-first traversal .

采用邻接表存储实现无向图的广度优先遍历。

Each agent in the network is described by a continuous -time dynamics and the communication network is described by a undirect graph .

网络中的每个成员都是一个连续时间的动力学系统，而它们之间通讯网络是用一个无向图来刻画的。

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

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

Aim To discuss the matching equivalence of the simple undirected graph .

目的讨论简单无向图的匹配等价问题。

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

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

Connectivity to the map without the depth and breadth- first traversal .

实现连通无向图的深度和广度优先遍历。

Listing 5 shows the buildDot. pl program for generating undirected graphs .

清单 5 展示了创建无向图的 buildDot.pl 程序。

The Adjacency Edge Growth Algorithm AEG for Determining Hamilton Cycle of a Simple Undirected Graph

确定简单无向图中 Hamilton 圈的邻接边增长算法

Research on the Properties of the Diameter of an Undigraph and its Algorithm Design

无向图直径的特性研究和算法设计

Minimum Augmentation of an Arbitrary Graph to an R -Vertex-Connected Graph

任意无向图的 R 点连通扩充

A Parallel Maximal Matching Algorithm for Undirected Graphs with Applications

无向图的边极大匹配并行算法及其应用

Undigraph-Based Whole Expression Model and Algorithm for the Skeleton of an Image

基于无向图的图像整体骨架表示模型及其算法

Drawing Undirected Graphs with Genetic Algorithms

用遗传算法画无向图

Study on diagonal structures in a non-directed graph

基于无向图的角联结构研究

The augmentation of undirected graph to a R-edge-connected graph based on hops-constraint

基于跳数约束的无向图 R 边连通扩充

无向图

无向图