2) directed networks
有向网络
1.
Based on non-uniform swarm,a dynamic model in directed networks was constructed.
用图论模型表示智能体之间的相互作用或通信关系,基于异构的智能群体,建立了动态的有向网络模型。
2.
The deformed Floyd algorithm of the shortest path between the two nodes in the directed networks is presented and the complexity of time shares the same rank with Floyd algorithm,but it reveals an object image and provides an easy way to programme.
给出了求有向网络中每对顶点间最短路径的变形Ｆｌｏｙｄ算法，其时间复杂度与Ｆｌｏｙｄ算法同量级，形象直观且易于编写程
3.
So far, few of researches have focused on the theory and application of directed networks, and most of them treated directed networks as a na?ve extension of undirected networks .
迄今为止,在复杂网络的研究中,对有向网络的系统的研究还很少,许多学者认为有向网络只是无向网络的自然扩充,他们把本属于有向网络的问题都简化抽象为无向网络问题。
3) Directed network
有向网络
1.
May be studied as the weighted directed network system.
具有网络通讯结构的信息系统在以Petri网为模型进行描述时可以归结为两类加权有向网络系统的研究,文章首先将Petri网模型描述下的信息系统结构分解为由两类性质不同的系统要素构成的有向网络图,并对这两类有向网络图引进了加权核和加权核度的概念和定义。
2.
The two-way search algorithm for finding the shortest path between two vertexes in a directed network in this paper is proposed.
提出了一种求解有向网络上两顶点间最短路径的双向搜索算法，经理论证明和实际应用，该方法较原Ｄｉｊｋｔｒａ算法可平均提高８倍的计算效
4) digraph network
有向网络
1.
In this paper, we study the propeties of the spanning incoming tree in a digraph network, and propose a simple algorithm for finding the minimum spanning incoming tree in a digraph network, we also present an example for applying this algorithm.
本文研究了有向网络中支撑入树的性质 ,提出了在有向网络图中寻找以某一指定点为根的最小支撑入树的一种较简便的算法 ,并给出了应用该算法的一个实际算
5) directed communication network
有向通信网
1.
Based on graph theory,the directed graph is mapped to the directed communication network;the problem of broadcasting-time for directed communication network is studied.
基于图论理论,将有向通信网映射成有向图,探讨了有向通信网的广播时间问题,给出了n个结点的有向网络的1-容错和2-容错广播所需的最少时间。
6) directed flows network
有向流网络
1.
It can measure all the edges that will be an empty flow in a directed flows network exactly and can dynamic adjust them and give a best plan for network.
提出了零流测定与动态调整的算法,精确测定有向流网络中所有可能成为零流量的弧,并能动态调整零流量弧,为网络规划提供最佳方案。
补充资料：网(有向集)
网(有向集)
net (directed set)
网(有向集)[吐(山n兄扭d滋);ceTI.」 一个有向集(dim曲沮set)到一个(拓扑)空间中的映射.M.H.Bo益uexoacK班益撰[补注】一个空间的拓扑能够完全用收敛性来描述.然而，这需要比序列收敛性概念更一般的收敛性概念.所需要的正是网的收敛(conVe耳笋川沈ofne匕).拓扑空间X中一个网S:D~X收敛到一个点s‘X，如果对、在X中每一个开邻域U，网S最终在U中(c记ntuallyinU).最后的短语是指存在一个m任D，使得对D中所有的n)m，S(”)6U. 网的收敛理论以Moore一51而th收敛(入玉刃祀一Smith田n祀r罗“笼)而闻名({All).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条