登录
首页 » matlab » ComplexNetworks-master

ComplexNetworks-master

于 2020-02-01 发布
0 192
下载积分: 1 下载次数: 2
我要下载

代码说明：

说明：  复杂网络工具箱，生成网络，计算节点度数，聚类系数(Complex network toolbox, generate network, calculate node degree, clustering coefficient)

文件列表：

ComplexNetworks-master, 0 , 2014-03-26
ComplexNetworks-master\README.md, 145 , 2014-03-26
ComplexNetworks-master\spec, 0 , 2014-03-26
ComplexNetworks-master\spec\gri-specs.pdf, 116460 , 2014-03-26
ComplexNetworks-master\tp0, 0 , 2014-03-26
ComplexNetworks-master\tp0\data, 7 , 2014-03-26
ComplexNetworks-master\tp0\distribution.sh, 966 , 2014-03-26
ComplexNetworks-master\tp1, 0 , 2014-03-26
ComplexNetworks-master\tp1\AUTHORS, 17 , 2014-03-26
ComplexNetworks-master\tp1\COPYING, 35147 , 2014-03-26
ComplexNetworks-master\tp1\ChangeLog, 0 , 2014-03-26
ComplexNetworks-master\tp1\INSTALL, 15752 , 2014-03-26
ComplexNetworks-master\tp1\Makefile, 23827 , 2014-03-26
ComplexNetworks-master\tp1\Makefile.am, 12 , 2014-03-26
ComplexNetworks-master\tp1\Makefile.in, 23417 , 2014-03-26
ComplexNetworks-master\tp1\NEWS, 0 , 2014-03-26
ComplexNetworks-master\tp1\README, 0 , 2014-03-26
ComplexNetworks-master\tp1\aclocal.m4, 41927 , 2014-03-26
ComplexNetworks-master\tp1\autom4te.cache, 0 , 2014-03-26
ComplexNetworks-master\tp1\autom4te.cache\output.0, 142422 , 2014-03-26
ComplexNetworks-master\tp1\autom4te.cache\output.1, 142422 , 2014-03-26
ComplexNetworks-master\tp1\autom4te.cache\requests, 7220 , 2014-03-26
ComplexNetworks-master\tp1\autom4te.cache\traces.0, 39560 , 2014-03-26
ComplexNetworks-master\tp1\autom4te.cache\traces.1, 21387 , 2014-03-26
ComplexNetworks-master\tp1\compile, 7333 , 2014-03-26
ComplexNetworks-master\tp1\config.log, 8828 , 2014-03-26
ComplexNetworks-master\tp1\config.status, 29065 , 2014-03-26
ComplexNetworks-master\tp1\configure, 141957 , 2014-03-26
ComplexNetworks-master\tp1\configure.ac, 348 , 2014-03-26
ComplexNetworks-master\tp1\depcomp, 23566 , 2014-03-26
ComplexNetworks-master\tp1\doc, 0 , 2014-03-26
ComplexNetworks-master\tp1\doc\gri-tp1.pdf, 135310 , 2014-03-26
ComplexNetworks-master\tp1\install-sh, 13997 , 2014-03-26
ComplexNetworks-master\tp1\missing, 6872 , 2014-03-26
ComplexNetworks-master\tp1\src, 0 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps, 0 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\avg_distance.Po, 2163 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\bfs.Po, 2209 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\compconnexes.Po, 2163 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\connexity.Po, 2157 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\distance.Po, 2155 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\graph.Po, 2505 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\ploc.Po, 8 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\plot.Po, 2363 , 2014-03-26
ComplexNetworks-master\tp1\src\.deps\queue.Po, 2735 , 2014-03-26
ComplexNetworks-master\tp1\src\Makefile, 18074 , 2014-03-26
ComplexNetworks-master\tp1\src\Makefile.am, 274 , 2014-03-26
ComplexNetworks-master\tp1\src\Makefile.in, 18167 , 2014-03-26
ComplexNetworks-master\tp1\src\bfs.c, 3508 , 2014-03-26
ComplexNetworks-master\tp1\src\bfs.h, 283 , 2014-03-26
ComplexNetworks-master\tp1\src\bool.h, 94 , 2014-03-26
ComplexNetworks-master\tp1\src\compconnexes, 24736 , 2014-03-26
ComplexNetworks-master\tp1\src\compconnexes.c, 1184 , 2014-03-26
ComplexNetworks-master\tp1\src\distance, 24784 , 2014-03-26
ComplexNetworks-master\tp1\src\distance.c, 682 , 2014-03-26
ComplexNetworks-master\tp1\src\distance.sh, 192 , 2014-03-26
ComplexNetworks-master\tp1\src\example.data, 74 , 2014-03-26
ComplexNetworks-master\tp1\src\graph.c, 5347 , 2014-03-26
ComplexNetworks-master\tp1\src\graph.h, 593 , 2014-03-26
ComplexNetworks-master\tp1\src\plot, 13572 , 2014-03-26
ComplexNetworks-master\tp1\src\plot.c, 2358 , 2014-03-26
ComplexNetworks-master\tp1\src\queue.c, 8137 , 2014-03-26
ComplexNetworks-master\tp1\src\queue.h, 998 , 2014-03-26
ComplexNetworks-master\tp1\src\testconn.sh, 190 , 2014-03-26
ComplexNetworks-master\tp2, 0 , 2014-03-26
ComplexNetworks-master\tp2\AUTHORS, 17 , 2014-03-26
ComplexNetworks-master\tp2\COPYING, 35147 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 10.52.30.png, 63591 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 22.12.17.png, 51992 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 22.12.30.png, 52784 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 22.12.56.png, 45787 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 22.13.32.png, 45492 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 22.14.08.png, 41524 , 2014-03-26
ComplexNetworks-master\tp2\Capture d’e_cran 2014-02-18 a_ 22.14.39.png, 56363 , 2014-03-26
ComplexNetworks-master\tp2\ChangeLog, 0 , 2014-03-26
ComplexNetworks-master\tp2\INSTALL, 15752 , 2014-03-26
ComplexNetworks-master\tp2\M2GRI - TP2 - Rapport.odt, 275893 , 2014-03-26
ComplexNetworks-master\tp2\M2GRI - TP2 - Rapport.pdf, 279582 , 2014-03-26
ComplexNetworks-master\tp2\Makefile, 23827 , 2014-03-26
ComplexNetworks-master\tp2\Makefile.am, 12 , 2014-03-26
ComplexNetworks-master\tp2\Makefile.in, 23417 , 2014-03-26
ComplexNetworks-master\tp2\NEWS, 0 , 2014-03-26
ComplexNetworks-master\tp2\README, 0 , 2014-03-26
ComplexNetworks-master\tp2\aclocal.m4, 41927 , 2014-03-26
ComplexNetworks-master\tp2\autom4te.cache, 0 , 2014-03-26
ComplexNetworks-master\tp2\autom4te.cache\output.0, 142422 , 2014-03-26
ComplexNetworks-master\tp2\autom4te.cache\output.1, 142422 , 2014-03-26
ComplexNetworks-master\tp2\autom4te.cache\requests, 7599 , 2014-03-26
ComplexNetworks-master\tp2\autom4te.cache\traces.0, 39560 , 2014-03-26
ComplexNetworks-master\tp2\autom4te.cache\traces.1, 21703 , 2014-03-26
ComplexNetworks-master\tp2\autoscan.log, 1530 , 2014-03-26
ComplexNetworks-master\tp2\compile, 7333 , 2014-03-26
ComplexNetworks-master\tp2\config.log, 8931 , 2014-03-26
ComplexNetworks-master\tp2\config.status, 29065 , 2014-03-26
ComplexNetworks-master\tp2\configure, 141957 , 2014-03-26
ComplexNetworks-master\tp2\configure.ac, 348 , 2014-03-26
ComplexNetworks-master\tp2\depcomp, 23566 , 2014-03-26
ComplexNetworks-master\tp2\doc, 0 , 2014-03-26
ComplexNetworks-master\tp2\doc\gri-tp1.pdf, 135310 , 2014-03-26
ComplexNetworks-master\tp2\install-sh, 13997 , 2014-03-26

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • source and report
    用Dijkstra算法求图中最短距离。从文件读入一个有向正权图（n个结点，m条边）的权矩阵表示，输出这个图中某一结点到其余各结点的最短路径长度。(Use Dijkstra agorithm to solve shortest path in map)
    2018-05-01 18:21:15下载
    积分：1
  • Polynomial Regression
    多项式回归代理模型的相关程序及算例，可选择线性、二阶、三阶多项式进行计算(The related procedures and examples of the polynomial regression proxy model can be selected by linear, second-order and third-order polynomials.)
    2020-11-02 17:09:54下载
    积分：1
  • fc3.m
    2016年数学建模-A 系泊系统设计中的第二问详细解答程序(Mathematical Modeling 2016-A Mooring System Design)
    2020-06-16 23:00:02下载
    积分：1
  • Python学习手册(第4版)
    说明：  让你对Python语言有深入而完整的了解，从而帮助你理解今后遇到的任何Python应用程序实例。(Let you have a thorough and complete understanding of the Python language, so as to help you understand any Python application examples you will encounter in the future.)
    2019-06-19 01:37:37下载
    积分：1
  • 切换系统仿真
    针对具有驻留概率的离散时间切换系统，研究了存在执行器故障的离散时间切换系统的故障估计和调节问题。假设驻留概率是先验已知的，通过使用降阶观测器方法、驻留概率方法和李雅普诺夫技术方法，针对所考虑的系统获得故障估计算法。(A kind of discrete-time switched system with actuator faults is studied. Here, it is assumed that the sojourn probabilities are known a priori. By using the reduced-order observer method, the sojourn probability approach, and the Lyapunov technique, a fault estimation algorithm is obtained for the considered system.)
    2018-06-10 16:03:09下载
    积分：1
  • CNLSE
    说明：  自相似孤子锁模光纤激光器谐振腔输出激光的仿真(Simulation of self similar soliton mode-locked fiber laser)
    2021-04-15 10:48:54下载
    积分：1
  • VC6_scope
    一个使用VC开发的示波器软件,显示界面较友好(VC developed using an oscilloscope software, show a more friendly interface)
    2009-11-15 17:18:57下载
    积分：1
  • zcjlrj
    自创的彼此交流账目软件，难得的好软件请一定要下来看看。(self-exchange accounts software, a rare good software must please look down.)
    2006-08-03 06:50:49下载
    积分：1
  • qm算法
    QM算法是用来最小化卡诺图的一个算法，其大概思路是，对蕴含项中1的个数进行分组，只有1的个数相差为1的蕴含项才可能相邻，所以可以通过循环来穷举出所有的主蕴含项。(The QM algorithm is an algorithm used to minimize the Kano map. The idea is that the number of 1 of the implying items is grouped and only 1 of the implication items with a difference of 1 may be adjacent, so that all the main implication items can be given out through the cycle.)
    2018-04-26 19:51:10下载
    积分：1
  • usb设计利用Cadence PCB SI分析特性阻抗变化因素
    usb设计利用Cadence PCB SI分析特性阻抗变化因素-usb design using Cadence PCB SI analysis of the characteristic impedance changes in factors
    2022-03-04 19:50:28下载
    积分：1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！