搜索资源列表
k-means
- 基于K-means聚类算法的社团发现方法 先定义了网络中节点关联度,并构建了节点关联度矩阵, 在此基础上给出了一种基于 K-means聚类算法的复杂网络社团发现方法。 以最小关联度原则选取新的聚类中心, 以最大关联度原则进行模式归类,直到所有的节点都划分完为止, 最后根据模块度来确定理想的社团数-K-means clustering algorithm based on the association discovery To define a network node cor
Partialdelaunaytriangulationanddegreelimitedlocali
- Partial delaunay triangulation and degree limited localized bluetooth scatternet formation- This paper addresses the problem of localized scatternet formation for multi-hop Bluetooth based personal area ad hoc networks. Nodes are assumed to
BiTree
- 强大的二叉树代码大全，前序，中序，后序，叶子结点，入度为1，2的节点的计数-Encyclopedia of powerful binary tree code, the former sequence, in order, after the sequence, the leaf nodes, to the degree of the node counts 1,2, etc.
fork
- 在某个家谱中，每人都生两个儿子。这些人之间的关系可以用二叉树来表示。这些二叉树总共有N个节点(3 <= N < 200)。这些二叉树有如下性质: 每一个结点的度是0或2。度是这个结点的儿子的数目。 树的高度等于K(1 < K < 100)。高度是从根到任何叶子的最长的路径上的结点的数目。有多少不同的家谱结构? 如果一个家谱的树结构不同于另一个的, 那么这两个家谱就是不同的。输出家谱树的个数除以9901之后的余数。-In a family tree, the p
trietreeJava
- trie的原理是利用字符串集合中字符串的公共前缀来降低时间开销以达到提高效率的目的。 它具有以下性质:1,根结点不包含任何字符信息 2,如果字符的种数为n,则每个结点的出度为n(这样必然会导致浪费很多空间,这也是trie的缺点,我还没有想到好点的办法避免) 3,查找，插入复杂度为O(n),n为字符串长度。-The principle is the use of a string trie collection of string prefix to reduce the time overh
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
sfnet-src-v002
- 生成无标度网络，可以计算网络的节点平均度、集聚系数等。-Generate scale-free network, the network node can calculate the average degree, clustering coefficient and so on.
network_backbone
- This function computes the backbone structure of a given weigthed graph (Matrix), keeping a minimum min_dens_nc degree for each node.-This function computes the backbone structure of a given weigthed graph (Matrix), keeping a minimum min_dens_nc de
kcsj
- 数据结构课程设计的，选存储结构,输入含n个顶点（用字符表示顶点）和e 条边的图G； (2)求每个顶点的度,输出结果； (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS)； (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS)； (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及 与之相关连的边,并作DFS遍历(执行操作3)；否则输出信 息“无x”； (6)判断图G是否是连通图，输出信
zui-da-liu
- 计算最大流程序，根据顶点，节点的出入度，随机生成网络并计算最大流。-Calculate the maximum flow procedures, randomly generated according to the degree of vertex and node access network and computing the maximum flow.
Locate
- 设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结
04595048
- the achievable rate of a K-user interference channel with single antenna at individual node is studied. Interference alignment and zero forcing are applied at the transmitter and receiver, respectively. It is well known from the paper [1] of
BT
- code for binary tree A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.
fz
- 求取复杂网络图中各个节点的度和度的分布曲线-To calculate the complex degree of each node in network diagram and degree distribution curve
Shoetest-path-Genetic-Algorithms
- Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network design problem. These problems are very common to back bone network design problem. In all these three problems, the main difference is the degree of the node whic
Exchange1
- 交换网络中节点的连边,保持网络总度数不变-Exchange randomly node link with total degree numbers unchange.
ScaleFreeNetwork
- 小世界网络的MATLAB程序，有网络节点度分布和网络模型图，读者可以自己设定参数。-MATLAB small world network, a network node degree distribution and network model diagram, the reader can set your own parameters.
matlab-degree_distribution
- matlab基于节点度对多层多域智能光（ASON）网络进行分域划分算法-matlab based on multi-node degree multi-domain intelligent optical (ASON) network partitioning algorithm Fenwick
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
BA6
- 展示了如何生成一个随机无标度网络图，基本结构分析，包括度分布、聚类系数等。观察两种类型的攻击对网络的影响：随机攻击（所有的几点有相同的概率从网络中删除）、有目标地选择连接度最大的节点（节点度最大的节点从网络中删除）。(Shows how to generate a random scale-free network graph, basic structural analysis, including degree distribution, clustering coefficients, e