登录
首页 » Visual C++ » GraphTheory

GraphTheory

于 2013-12-04 发布 文件大小:5117KB
0 225
下载积分: 1 下载次数: 4

代码说明:

  讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)

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

发表评论

0 个回复

  • data_structure
    数据结构c源代码实现,大概有100个左右,基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)
    2012-07-19 21:43:52下载
    积分:1
  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分:1
  • 1_1
    最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
    2009-09-13 22:45:01下载
    积分:1
  • Hash-table
    本代码主要实现了哈希表的设计,完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)
    2013-12-30 17:15:14下载
    积分:1
  • the-dynamic-planning
    本文讨论了动态规划这一思想的核心内容和其基本特点,探讨了动态规划思想的适用范围,动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )
    2011-12-15 16:49:05下载
    积分:1
  • C-data
    大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
    2016-12-23 23:43:39下载
    积分:1
  • DataStructureTest
    数据结构的一些基本的相关的试验,如二叉树的遍历,打印,如排序算法,检索算法,动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)
    2009-01-20 13:18:22下载
    积分:1
  • floy
    floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)
    2007-11-13 23:39:25下载
    积分:1
  • BigNumeberOperator
    这是高精度大数运算的源码,对于大于64位的整形数字的四则运算,是万能的啊……(This is the code of big number s operator.)
    2011-08-09 15:25:09下载
    积分:1
  • FreeTree
    无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
    2013-10-29 16:31:47下载
    积分:1
  • 696516资源总数
  • 106741会员总数
  • 17今日下载