登录
首页 » matlab » ComplexNetworksPackage.1.6.Win

ComplexNetworksPackage.1.6.Win

于 2013-11-08 发布 文件大小:25961KB
0 185
下载积分: 1 下载次数: 49

代码说明:

  Matlab 复杂网络工具包,对复杂网络的研究有很大的重要性。(Matlab complex network toolkit for complex network research has great importance.)

文件列表:

Graph
.....\BugsList.doc,26624,2012-01-10
.....\DynamicProcess
.....\..............\DynamicProcessInitialize.m,5799,2012-03-11
.....\..............\DynamicProcessInitializeSI.m,4564,2012-03-17
.....\..............\DynamicProcessInitializeSI2d.m,6425,2012-03-28
.....\..............\DynamicProcessInitializeSIR.m,4807,2012-03-07
.....\..............\DynamicProcessInitializeSIS.m,4387,2012-03-07
.....\..............\DynamicProcessIterate.m,1667,2012-03-07
.....\..............\DynamicProcessTutorial_01.m,5421,2012-03-23
.....\..............\DynamicProcessTutorial_01_02.m,5422,2013-01-05
.....\..............\Graph1.dot,592213,2012-03-18
.....\..............\Graph2.dot,592213,2012-03-18
.....\..............\private
.....\..............\.......\DynamicProcessConvertGraph.Karim.m,2028,2012-05-04
.....\..............\.......\DynamicProcessConvertGraph.m,2047,2012-03-06
.....\..............\.......\GetDefaultInputInitialize.m,485,2012-03-06
.....\FastSet
.....\.......\fast_find_range_sorted.m,1379,2012-07-17
.....\.......\fast_find_range_sorted.mexw32,17920,2013-02-26
.....\.......\fast_find_range_sorted.mexw64,23552,2013-02-26
.....\.......\fast_frequency.m,2138,2012-01-10
.....\.......\fast_frequency.mexw32,9728,2013-02-26
.....\.......\fast_frequency.mexw64,10240,2013-02-26
.....\.......\fast_intersect_sorted.m,2211,2012-01-10
.....\.......\fast_intersect_sorted.mexw32,15872,2013-02-26
.....\.......\fast_intersect_sorted.mexw64,19968,2013-02-26
.....\.......\fast_ismember_sorted.m,2123,2012-01-21
.....\.......\fast_ismember_sorted.mexw32,12288,2013-02-26
.....\.......\fast_ismember_sorted.mexw64,14848,2013-02-26
.....\.......\fast_setdiff_sorted.m,2036,2012-01-21
.....\.......\fast_setdiff_sorted.mexw32,15872,2013-02-26
.....\.......\fast_setdiff_sorted.mexw64,18432,2013-02-26
.....\.......\fast_setxor_sorted.m,2251,2012-01-10
.....\.......\fast_setxor_sorted.mexw32,18944,2013-02-26
.....\.......\fast_setxor_sorted.mexw64,23040,2013-02-26
.....\.......\fast_union_sorted.m,2263,2012-01-10
.....\.......\fast_union_sorted.mexw32,18432,2013-02-26
.....\.......\fast_union_sorted.mexw64,21504,2013-02-26
.....\.......\fast_unique.m,2700,2012-01-26
.....\.......\fast_unique.mexw32,288768,2013-02-26
.....\.......\fast_unique.mexw64,433152,2013-02-26
.....\FlexIO
.....\......\FIOAddParameter.m,1084,2007-05-25
.....\......\FIOParameterNames.m,709,2007-05-25
.....\......\FIOProcessInputParameters.m,1468,2007-05-25
.....\......\FIOTestInput.m,1439,2007-05-25
.....\......\vssver.scc,96,2002-07-16
.....\GraphBetweennessCentrality.m,2052,2012-01-10
.....\GraphBetweennessDegreeHierarchy.m,3925,2012-03-28
.....\GraphComponents.m,1507,2012-03-28
.....\GraphComponentsDirected.m,1475,2012-03-28
.....\GraphConfigurationModel.m,1571,2012-12-13
.....\GraphConvertFromV2.m,1065,2012-03-28
.....\GraphConvertToLineGraph.m,2418,2012-01-10
.....\GraphCountNodeDegree.m,1043,2012-03-28
.....\GraphCountNodesDegree.m,2144,2012-03-28
.....\GraphCountNumberOfLinks.m,681,2012-03-28
.....\GraphCountNumberOfNodes.m,856,2012-03-28
.....\GraphCountStatistics.m,1773,2012-03-28
.....\GraphCountUnderectionality.m,2806,2012-03-28
.....\GraphCreateRandomGraph.m,1514,2012-03-28
.....\GraphCreateSmallWorld.m,1660,2012-11-30
.....\GraphDrawPajek.m,3087,2012-03-28
.....\GraphExportToFile.m,3412,2012-03-28
.....\GraphExportToGML.m,12293,2012-03-28
.....\GraphExportToPajek.m,4231,2012-03-28
.....\GraphFindCrossLinks.m,1275,2012-03-28
.....\GraphGenerateCompleteBipartiteGraph.m,1229,2012-03-28
.....\GraphGenerateCompleteGraph.m,1064,2012-03-28
.....\GraphGenerateCompleteKPartiteGraph.m,975,2012-03-28
.....\GraphGenerateSquareLattice.m,1459,2012-03-28
.....\GraphGetNodeNames.m,1161,2012-03-28
.....\GraphGetNodeProperty.m,3268,2012-03-28
.....\GraphGIUBrowseGraph.m,53818,2012-03-28
.....\GraphGIUBrowseGraph.mat,488,2012-01-10
.....\GraphGIUBrowseGraph01.m,53467,2012-03-28
.....\GraphGIUSelectGraph.m,6896,2012-03-28
.....\GraphIsUndirected.m,159,2012-12-13
.....\GraphKShell.m,1071,2012-03-28
.....\GraphLinkAdd.m,2063,2012-03-28
.....\GraphLinkFind.m,1671,2012-03-28
.....\GraphLinkRemove.m,1779,2012-03-28
.....\GraphLoad.m,3859,2012-03-28
.....\GraphLoadAdjacencyMatrixFromFile.m,1276,2012-03-28
.....\GraphLoadFromFile.m,664,2012-03-28
.....\GraphLoadGML.m,3579,2012-11-25
.....\GraphLoadGraphLayoutPlain.m,4588,2012-11-14
.....\GraphLoadSample.m,12017,2013-02-25
.....\GraphMakeUndirected.m,659,2012-03-28
.....\GraphNodeAdd.m,1396,2012-03-28
.....\GraphNodeDistancesDistribution.m,2605,2012-03-28
.....\GraphNodeFirstNeighbours.m,1421,2012-03-28
.....\GraphNodeIDs.m,620,2012-03-28
.....\GraphNodeRemove.m,2079,2012-03-28
.....\GraphPlotGraphLayout.m,7863,2012-11-14
.....\GraphPlotNodesDegreeDistribution.m,7283,2012-03-28
.....\GraphPlotNodesDegreeDistributionNature.m,7454,2012-03-28
.....\GraphRemoveDuplicateLinks.m,967,2012-03-28
.....\GraphRemoveReciprocalLinks.m,1238,2012-12-05

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

发表评论

0 个回复

  • matlab_point
    说明:  此软件可用来计算节点数,也可用来计算一些简单的算法,如果你对数据结构感兴趣,也可以用此软件解决数据结构的很多问题 (software can be used to calculate nodes, but also can be used to calculate some simple algorithm, If you are interested in the data structure can also use this software to solve many data structure problem)
    2006-01-08 17:03:03下载
    积分:1
  • daqiMTF
    关于大气MTF的资料,有助于理解大气MTF的作用,估计计算大气MTF的值。(The information on atmospheric MTF, help to understand the role of atmospheric MTF, estimate calculated atmospheric MTF value)
    2015-02-01 11:13:32下载
    积分:1
  • 1
    说明:  图像处理应用及相关说明,matlab相关函数的应用及说明(Image processing applications)
    2011-04-06 09:45:14下载
    积分:1
  • NaiveBayesClassifier.tar
    naive Bayesian Classifier for classification
    2012-06-20 17:43:55下载
    积分:1
  • WindyGridWorldQLearning
    Q-learning (Watkins, 1989) is a simple way for agents to learn how to act optimally in controlled Markovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successively improving its evaluations of the quality of particular actions at particular states. This paper presents and proves in detail a convergence theorem for Q,-learning based on that outlined in Watkins (1989). We show that Q-learning converges to the optimum action-values with probability 1 so long as all actions are repeatedly sampled in all states and the action-values are represented discretely. We also sketch extensions to the cases of non-discounted, but absorbing, Markov environments, and where many Q values can be changed each iteration, rather than just one.
    2013-04-19 14:23:35下载
    积分:1
  • Reducing-the-Number
    基于矩阵笔方法的稀疏阵列综合,是一篇引用率很好的文章(matrix pencil)
    2014-11-17 13:04:10下载
    积分:1
  • music
    matlab 做的一个GUI,用于模拟电子琴(matlab to do a GUI for simulation flower)
    2013-04-25 23:47:51下载
    积分:1
  • code
    function [r_path, r_cost] = dijkstra(pathS, pathE, transmat) The Dijkstra s algorithm, Implemented by Yi Wang, 2005 This version support detecting _cyclic-paths_
    2009-04-27 19:49:50下载
    积分:1
  • matched_filter
    基于匹配滤波器的线性调频雷达回波产生及压缩(LFM matched filter-based radar echo generation and compression)
    2010-11-30 22:18:52下载
    积分:1
  • matlab-gui
    说明:  matlab图形界面设计(GUI)dfdfdfs(matlab gui)
    2011-04-18 18:11:11下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载