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

edge-betweenness

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

  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • elevator
    电梯模拟,实现一个模拟电梯的环境,用C程序实现的,封装良好(elevator modify)
    2021-04-22 15:38:48下载
    积分:1
  • Kruskal
    采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
    2011-05-17 10:22:56下载
    积分:1
  • b-trees
    ① 实现在B-树上的查找,并分析其时间复杂性。 ② 实现B-树的ADT,包括其上的基本操作:结点的加入和删除。 ③ 要求B-树结构中的M=3 或5,实现其中的一种即可。 ④ 实现基本操作的演示。 (4) 实现提示 (b-trees c/c++)
    2021-01-20 09:48:41下载
    积分:1
  • BresenhamLine
    在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)
    2012-06-03 18:21:13下载
    积分:1
  • ddt
    多段图、遍历、排序。用C语言解决多段图中的成本问题,得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )
    2012-05-12 13:49:10下载
    积分:1
  • QuickSort
    快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
    2013-03-22 21:21:16下载
    积分:1
  • 12
    说明:  c编写的链表连接函数,上课时学的,上传试试 (c write the list to connect function, class, learn, try uploading)
    2010-07-08 15:27:22下载
    积分:1
  • B_Tree
    用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
    2020-10-18 17:47:26下载
    积分:1
  • Task1-trial--10211281--zly
    描述:足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数;普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序,实现对众多足球俱乐部管理的基本功能。具体功能包括: a) 俱乐部的增删改查,俱乐部的属性包括名称、现金、其下人员; b) 可以对所有球员的各项属性进行简单搜索,支持输入多个条件,条件之间用&&连接,例如: i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”,查询表达式:!(@age>25) && @experience>5 && @kick>100 c) 支持球员在不同俱乐部间的买卖,买卖需符合以下条件:作为买方的俱乐部的现金>=球员的转会费,交易完成后,卖方将得到转会费。 要求: d) 必须采用面向对象的方式,使用类组织数据结构,并注意类的继承关系; e) 在题目要求基础上可以自行扩展功能,提供扩实用扩展功能者适当加分(加分不超过5分)。 (Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include: a) the club CRUD, the name of the club s property, including cash, under which personnel b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example: i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100 c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)
    2013-08-20 10:09:29下载
    积分:1
  • 696518资源总数
  • 106235会员总数
  • 12今日下载