搜索资源列表
node-degree
- 复杂网络 节点度统计程序 C++ 网络中的节点度指与节点相连的边的个数-Complex statistical procedures for network nodes C++ Network nodes and node degrees refers to the number of connected edge
include
- 根据输入的整数对，输出一个图形的邻接矩阵。并求出各结点的出度和入度；判断邻接矩阵是否是可达性矩阵，从而判断图是否是连通图。-The input of integer pair, the output of a graph adjacency matrix. And obtained the degree of each node and the in-degree determine whether it is up to the adjacency matrix matrix, which
Exchange
- 此程序用来处理复杂网络中的交换节点的度的处理-This procedure is used to handle the processing of the complex network switching node degree
dajacency
- 有关离散数学的编程 实验四：邻接矩阵 1．编写一段代码，接收键盘的输入定点的数量，并以输入的整数对作为边来建立图形的邻接矩阵（无向权重图）。 例如 ： 5，6，12 表示定点5和定点6间有边，边的权重为 12。 2 打印出邻接矩阵。 3．根据第一步得到的邻接矩阵计算每个结点的度数。 -Experiment IV: adjacency matrix 1. Write a piece of code, the number of sentinel receive
Binary_Tree
- 二叉树是每个节点最多有两个子树的有序树。通常子树被称作“左子树”（left subtree）和“右子树”（right subtree）。二叉树常被用于实现二叉查找树和二叉堆。值得注意的是，二叉树不是树的特殊情形。在图论中，二叉树是一个连通的无环图，并且每一个顶点的度不大于3。-Each node in a binary tree is an ordered tree up to two sub-tree. Usually sub-tree is called " left sub-tre
add_edge
- 在社会网络中，采用MATLAB计算图的连通性和节点平均度数的两个算法-Two algorithms in the social network, using MATLAB computing node graph connectivity and average degree of
benchmark
- LFR benchmark用于产生LFR基准测试网络，用于复杂网络社区检测中算法的测试网络。-This class of benchmark graphs called LFR have been proposed by Lancichinetti etal., in which the distributions of node degree and community size are both power laws with tunable exponents. It s modeled
GraphPlotNodesDegreeDistribution
- 复杂网络中统计节点的度分布，同时画出节点度分布的源程序(The degree distribution of statistical nodes in complex networks, and draw the source of the degree of node distribution)