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

edge-betweenness

于 2021-05-15 发布 文件大小:754KB
0 344
下载积分: 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 个回复

  • joseph
    用链表解决约瑟夫问题。 约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。 其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
    2012-08-27 22:37:52下载
    积分:1
  • 5100309373_2_9
    数据结构习题答案,线性链表的实现与适用,数据结构:思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)
    2012-11-23 11:12:48下载
    积分:1
  • sort
    自己编写的几种经典的排序算法,里面有自己做的PPT详细讲解,希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)
    2012-08-28 09:31:28下载
    积分:1
  • expression
    利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
    2011-10-30 14:14:01下载
    积分:1
  • liu
    一.问题描述 对2006年度全国80多个城市的每天空气质量状况进行查询、排序等操作。 空气质量状况对象包括城市代码、城市名称、首要污染物、污染指数、污染物级别、空气状况、年、月、日 二、实验要求 1. 普通查询:输入城市名称和城市代码,分别查询该城市每天、每周、每月、每季度和全年的空气质量状况 例子:查询太原市2006年第8周的空气质量状况 2.统计查询: (1)输入城市名称和城市代码,分别查询该城市每周、每月、每季度和全年的空气质量为优、良、轻微污染、轻度污染、重污染的天数 例子:查询石家庄市2006年第2季度空气质量为轻微污染的总天数 (2)根据时间查询空气质量状况:输入周编号、月编号、季度编号或年编号,以及空气质量为优、良、轻微污染、轻度污染、重污染的天数,查找相应的城市名称 例子:查询2006年5月,空气被轻度污染3天以上的城市有哪些? 3.排序查询 (1)输入周编号、月编号、季度编号或年编号,查询城市空气质量的排行榜 例子:查询2006年第6周,全国空气平均质量最好的前20个城市为哪些? 三、数据文件 Data.txt(one. Problem Description of the air quality day in 2006 more than 80 cities nationwide query, sorting and other operations. Air Quality objects include city code, city name, the primary pollutant, pollution index, contaminant level, air condition, year, month, day two, experimental requirements 1. General Queries: Enter a city name and city codes, each query in the city daily, weekly, monthly, quarterly example air quality and full year: Queries air quality in Taiyuan first eight weeks of 2006 2. Statistical inquiry: (1) enter a city name and city codes, each query in the city weekly, monthly, quarterly and annual air quality as excellent, good, slight pollution, light pollution, heavy pollution days example: inquiry Shijiazhuang City in 2006 second quarter, the air quality is the total number of days a slight pollution (2) according to time of the query air quality conditions: enter the week number, month number, quarter number or in number, and the air quality is excellent, good, sli)
    2017-04-07 10:58:37下载
    积分:1
  • graph-DFS
    邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
    2013-10-27 20:16:41下载
    积分:1
  • add-sub
    实现了多项式的创建,实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)
    2011-08-15 17:34:46下载
    积分:1
  • findpt
    VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
    2013-05-17 15:38:23下载
    积分:1
  • Tetris
    使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
    2013-03-27 10:51:16下载
    积分: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
  • 696518资源总数
  • 106215会员总数
  • 5今日下载