登录
首页 » matlab » 平均路径长度&聚类系数计算

平均路径长度&聚类系数计算

于 2020-06-19 发布
0 300
下载积分: 1 下载次数: 5

代码说明:

说明:  本程序是完成网络的评价路径长度和聚类系数的计算。(This program is to calculate the average path length and clustering coeffient of a network.)

文件列表:

Clustering_Coefficient.m, 922 , 2013-04-26
Aver_Path_Length.m, 916 , 2012-07-14

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • stability_lobe
    用于铣削动力学建模的稳定性叶瓣图分析(全离散法)(The full discrete method is used to map the stability lobe)
    2018-01-24 20:28:05下载
    积分:1
  • NLFM_signal
    说明:  非线性调频信号的产生函数,以及绘制时域频域图像(Proudce a NLFM signal,use for radar test)
    2019-09-25 16:46:50下载
    积分:1
  • bldc_two_close_loop_2015rb(2)
    无刷直流电机调速仿真。PI转速和电流双闭环(Speed control simulation of Brushless DC motor)
    2018-05-24 22:56:07下载
    积分:1
  • 无人机型_GUI
    说明:  无人机模型,GUI界面,模拟飞机飞行过程(UAV model GUI interface Simulation of aircraft flight process)
    2020-10-29 17:22:20下载
    积分:1
  • wave simulation
    说明:  通过频谱来模拟波浪,程序为Jonswap谱的波浪模拟,可随意调整谱参数、时间间隔和模拟的时间长度(The wave is simulated by the spectrum, and the program is a wave simulation of the Jonswap spectrum. The spectral parameters, time interval and length of the simulation can be adjusted at will.)
    2021-01-04 15:58:55下载
    积分:1
  • J2
    说明:  关于J2塑性流动理论的金属3的材料本构隐式子程序umat(Implicit Subprogram UMAT for Material Constitutive of Metal 3 in J2 Plastic Flow Theory)
    2019-03-20 13:16:17下载
    积分:1
  • 实测可用的PV特性
    实测可用的PV特性分析,增加几个个人搜集的扰动观察法代码,可以共同学习研究(The available PV characteristic analysis of the actual measurement can be added with the disturbance observation code collected by several individuals, which can be studied together)
    2020-04-13 14:14:13下载
    积分:1
  • 边界随时间udf
    Fluent 实现随时间或坐标变化边界条件的方法udf(udfFluent implements the method of changing boundary conditions with time or coordinates UDF)
    2021-03-06 09:59:30下载
    积分:1
  • C++源代码-Shugong Wang
    C++实现三水源新安江模型,暴雨-径流过程模拟(XinAnJiang Hydrological Moedl)
    2017-08-08 17:43:01下载
    积分:1
  • matlab_bgl.part01
    节点度是指和该节点相关联的边的条数,又称关联度。 特别地,对于有向图, 节点的入度 是指进入该节点的边的条数; 节点的出度是指从该节点出发的边的条数。(Node degree refers to the number of edges associated with the node, also known as the degree of association. In particular, for a directed graph, The ingress of a node is the number of edges entering the node; The out-degree of a node is the number of edges that start from that node.)
    2018-07-23 21:52:37下载
    积分:1
  • 696516资源总数
  • 106446会员总数
  • 9今日下载