搜索资源列表
BA50
- 50个节点的BA网络模型中用穷举法求支配集-50 node network model BA exhaustive method used for dominating set
randht
- 对于复杂网络中各种节点的分布进行计算和求证时不是幂律分布，并求出相关的指数。-Power-law distribution of complex networks
16008408_E2
- 1、使用带辅助向量的三元组表技术，实现电力系统节点导纳矩阵的存储； 2、程序通过键盘或文件输入支路参数（支路阻抗），形成导纳矩阵，并使用带辅助向量的三元组表技术存储导纳矩阵； 3、通过对话框或键盘输入导纳矩阵元素的行、列号，在矩阵中查找相应的元素，并显示该元素的实部和虚部值； 4、通过运算求出与该导纳矩阵相对应的电力网络的阻抗矩阵，并显示或存储（存储在文本文件中）该矩阵的所有元素值； 5、该实验中矩阵的存储应使用稀疏矩阵存储技术 -1, the use of auxiliar
IEEE009YY
- 根据IEEE标准算例给出的9节点网络图，利用MATLAB软件编程计算其节点导纳矩阵（含有解释）。当然，依据程序稍作修改可以求IEEE算例中的任意节点导纳矩阵。-Example is given according to the IEEE standard 9-node network diagram, using MATLAB software program to calculate the nodal admittance matrix (with explanation). Of cour
2011-12-23-1337
- 复杂网络，系统设计，牵制控制，可自行设计控制点、网络节点。内耦合矩阵，外耦合矩阵，采用全局网络，实现分析系统是否收敛。可求平衡点，Jacabi矩阵-Complex networks, systems design, contain control, can design their own control point, the network node. Coupling matrix within and outside the coupling matrix, using the globa
complex-network-node
- 求网络图中各节点的度及度的分布曲线，在在workplace中运行。-For network diagram of each node in degrees and degree of the distribution curve, in addition, in the workplace operation.
duioutu
- 主要是针对复杂网络中节点关系图，求取矩阵中的对偶矩阵，求取节点重要度公式-Mainly for nodes in complex networks diagram, calculate the matrix of the dual matrix, the formula for calculating node important degree
geodes
- 求复杂网络节点之间的最短距离，也叫做测地线，对复杂网络的拓扑性质的分析很重要-Complex networks seeking the shortest distance between nodes, also called geodesic network topological properties of complex analysis is very important
Degree_Distribution
- 复杂网络度分布计算， 求网络图中各节点的度及度的分布曲线-The complexity of the distributed computing network
Clustering_Coefficient
- 求网络图中各节点的聚类系数及整个网络的聚类系数 求解每个节点的聚类系数，找某节点的所有邻居，这些邻居节点构成一个子图-Seeking clustering coefficient network diagram and the entire network clustering coefficient of each node
介数
- 此程序可以求复杂网络（有向或者无向）节点和边的介数，
NCN
- 本代码是求网络中任意两个节点之间的共同邻居数目，是我自己写的，一个用common neighborsde的方法。-This code is common between the number of neighbors seeking any two nodes in the network, I wrote it myself, and a method of using common neighbors.
Degree_DistributionSCIgamma(1)
- 利用matlab语言求出网络节点的度及度分布曲线-One can obtain nodes degree and degree distribution curves by using this matlab codes
Get_loop
- 用于求网络中从某一节点开始形成环路到该节点结束的节点编号。对于求路径的问题会有一定的帮助-Used to find a node the network began to form a loop to the end node node numbers. To seek the path of problem would certainly help
Degree
- 社交网络度中心性算法，按节点的度值求出节点的编号-Social network centricity algorithm, according to the node degree of the node number
生成节点导纳
- 求节点导纳矩阵，从电力网络线路的，一些已知参数，求未知参数(Node admittance matrix)
代码2
- 以读文件的方式，求网络中的源节点到目标节点的最短路径(By reading the file, the shortest path from the source node to the target node is searched)
betweenness_node
- matlab程序程序，用于求网络节点及边介数。(Network node and edge betweenness program)
Electrical Network
- 给定网络N，求其关联矩阵A，基本回路矩阵 ，基本割集矩阵 。 给定网络N，形成节点导纳矩阵Y，求逆得Z；利用支路追加法对追加一条支路（树支/连支）后的网络进行修正。 利用稀疏存储技术实现对 的查找；节点优化技术（动态、半动态）；因子表技术。(Given network N, and its associated matrix A, basic circuit matrix, the basic cut set matrix. Given the network N, the node ad
复杂网络
- 求网络图中各节点的度及度的分布曲线， 聚类系数及整个网络的聚类系数，和复杂网络中两节点的距离以及平均路径长度(Find the degree and degree distribution curve of each node in the network graph, the clustering coefficient and the clustering coefficient of the whole network, the distance between two nodes in