network graph

network graph的基本解释

-

网络图

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

Ava Universal Network/Graph Framework - JUNG provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network.

UNG 提供了一个公共的可扩展的语言来建模、分析和可视化数据，数据可以通过图形或网络来提供。

Taking the active network as a research task, the input accessibility, the Coates graph of matrix and graph transmission etc are used to analyze the relation between reducibility of the coefficient matrix of the state equation and the electric separability of the network or the electric accessibility of the network for the first time, acquiring sufficient and necessary conditions that coefficient matrix of the state equation is reducible. Network Graph Theory, Matrix Theory and System Theory over F etc are used to derive the structural controllability criterion of the passive network over F for the first time. Then according to these theoretic results, the structural controllability problems of the active network over F are studied, acquiring several structural controllability conclusions of the active network.

率先将状态方程的输入可达、矩阵的Coates图、流图传输系数等概念和方法引入到对F上有源电网络的研究，研究了网络状态方程的系数矩阵的可约性与网络电气可断性或电气可达之间的关系，研究了F上有源电网络的能控性问题，获得了状态方程的系数矩阵可约的充分必要条件、F上有源电网络系统的结构能控性判据等新的结论。

In order to get out from the cockamamie work in road route design for designers, on the basis of studying the internal relations among local schemes, local scheme was decomposed to small unit logic schemes; the directed network was used to represent the topological connection; the united data structure of point-arc was used to express a network graph. Based on the shortest path theory, the combinatorial optimization algorithm that can search optimal logical schemes of some targets in the network graph intelligently and can form the whole scheme automatically was put forward.

为了使设计者从道路线路设计的繁重计算统计工作中解脱出来，在研究了局部方案间内在关联的基础上，提出了将局部方案分解为更小单位的逻辑方案，用有向网络图表示逻辑方案间的拓扑关系，采用节点－弧段联合数据结构来表示网络图；同时基于最短路径理论，提出了在网络图中智能化搜索综合指标最优的逻辑方案集，自动形成整体方案的组合优化算法。

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

acyclic graph：非循环图

非循环馈送图 acyclic feeding graph | 非循环图 acyclic graph | 非循环网络 acyclic network

digital line graph：数字线化图

配电载波通信:Network-based Distribution Line Carrier Communication | 数字线化图:Digital Line Graph | 数字用户环路:digital subscriber line

weighted graph：赋权图

若图的边有一个权值(weight),则称为赋权边,所形成的图称赋权图(weighted graph)或网络(network). 用三元组G(V,E,W)表示网络. 其中W表示权集,它的元素与边集E一一对应. 满足的图,称为稀疏(sparse)图;反之,称为稠密(dense)图.