登录
首页 » Visual C++ » edge-betweenness

edge-betweenness

于 2021-05-15 发布 文件大小:754KB
0 295
下载积分: 1 下载次数: 199

代码说明:

  计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)

文件列表:

边介数算法
..........\Debug
..........\.....\Length.exe,249916,2011-07-29
..........\.....\Length.ilk,293760,2011-07-29
..........\.....\Length.obj,50825,2011-07-29
..........\.....\Length.pch,1292552,2011-07-28
..........\.....\Length.pdb,615424,2011-07-29
..........\.....\vc60.idb,82944,2011-07-29
..........\.....\vc60.pdb,102400,2011-07-28
..........\Length.cpp,7344,2011-07-28
..........\Length.dsp,3401,2011-07-29
..........\Length.dsw,520,2011-07-29
..........\Length.ncb,41984,2011-07-29
..........\Length.opt,48640,2011-07-29
..........\Length.plg,746,2011-07-29
..........\node.txt,147348,2009-07-01
..........\node1.txt,0,2011-07-20
..........\node2.txt,29741,2011-07-20
..........\node2Crd.##d,6540,2011-07-22
..........\node2Crd.##h,5854,2011-07-22
..........\node3.##d,100,2011-07-28
..........\node3.##h,125,2011-07-28
..........\node3.txt,125,2011-07-20
..........\node3Crd.##d,60,2011-07-28
..........\node3Crd.##h,111,2011-07-28
..........\node4.##d,100,2011-07-28
..........\node4.##h,125,2011-07-28
..........\node4.txt,105,2011-07-28
..........\node4Crd.##d,60,2011-07-28
..........\node4Crd.##h,111,2011-07-28
..........\node5.##d,64,2011-07-28
..........\node5.##h,119,2011-07-28
..........\node5.txt,91,2011-07-28
..........\node5Crd.##d,48,2011-07-28
..........\node5Crd.##h,108,2011-07-28
..........\Queue.h,837,2011-07-20
..........\介数边介数.txt,98,2011-07-29
..........\新建 Microsoft Excel 工作表.xls,13824,2011-07-29
..........\邻接表.txt,46,2011-07-29
..........\顶点边介数.txt,35,2011-07-29

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

发表评论

0 个回复

  • point_to_line
    计算点到直线的距离.输入两点坐标确定一个直线,再输入一个点的坐标,计算该点到直线的距离.(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)
    2020-11-30 15:09:27下载
    积分:1
  • Dijkstra
    迪杰斯特拉算法,数据结构,C语言写的,上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
    2013-03-06 21:50:34下载
    积分:1
  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • 算法集锦
    数据结构算法集锦:包括大量常用算法,如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
    2005-06-28 19:55:07下载
    积分:1
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • Introduction-to-Algorithms
    算法导论的英文版,讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)
    2015-09-14 16:44:34下载
    积分:1
  • binary
    实现对二叉树的操作:建树、遍历、求层高、叶子数和结点数等(binary tree)
    2011-12-09 15:58:29下载
    积分:1
  • yuesefuhuan
    使用VC编写的约瑟夫环程序,简单明了,方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
    2009-09-08 16:45:26下载
    积分:1
  • tree
    求二叉树的深度: 给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 (Description 给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 )
    2011-12-11 20:42:18下载
    积分:1
  • hanoi
    Hanoi塔问题非递归算法实现,几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)
    2009-07-13 08:45:51下载
    积分:1
  • 696518资源总数
  • 105554会员总数
  • 2今日下载