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

edge-betweenness

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

  • 1
    说明:  数据结构中的顺序表,是其中的一个重要组成部分(The order of the table data structure is an important component of which)
    2011-05-06 14:34:13下载
    积分:1
  • HEAP
    poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
    2013-11-21 23:03:15下载
    积分:1
  • Data-Structure11-15
    本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上,全面系统地介绍了队列、堆栈、树、图等基本数据结构,以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法,为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是,本书不仅仅介绍了理论知识,还提供了50多个应用实例及600多道练习题。 本书内容广博权威,结构清晰合理,是一本全新的有关数据结构与算法的教材,对于计算机科学与工程领域的从业人员也是一本很好的参考书。 11-15章 (This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. In a brief review of the book based on the basic concept of C++ programming on a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms divide and conquer algorithms, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Chapter 11-15)
    2014-05-30 09:27:46下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • Classic-single-linked-list
    单链表是C经典数据结构算法和数据结构,希望这对大家学习有点用(Classic single-linked list data structure in C algorithms and data structures, which we hope to learn a little bit with)
    2011-08-02 12:33:26下载
    积分:1
  • Subset
    说明:  子集和数问题.rar,用C++写的,可以运行(Subset of several problems. Rar, written in C++, you can run)
    2010-04-16 17:42:12下载
    积分:1
  • KD-tree
    kd-树(k维搜索树)是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
    2013-05-10 11:03:53下载
    积分:1
  • delete
    数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
    2012-11-14 12:59:15下载
    积分:1
  • eitTableParse
    该程序分析eit表的数据结构,病输出相应内容信息(parse eit table and output content info)
    2016-05-22 17:52:42下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载