登录
首页 » Visual C++ » GraphTheory

GraphTheory

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

代码说明:

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

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

发表评论

0 个回复

  • 123
    中科大数据结构全部上机实验的实验程序以及报告,内容包括多项式,图,栈,SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
    2020-10-14 19:57:30下载
    积分:1
  • Bigint
    利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
    2007-10-18 21:34:06下载
    积分:1
  • lab07
    本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
    2013-05-12 22:01:58下载
    积分:1
  • quicksort
    数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
    2013-05-23 15:05:53下载
    积分:1
  • DataStructAndAlgorithm
    数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)
    2009-03-14 17:56:03下载
    积分:1
  • maze
    一个苹果走迷宫,支持最短路径寻路。可以使用方向键操作,也可以用户自己添加迷宫格式文件,生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)
    2012-09-11 21:33:01下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • Numbersequence
    说明:  简单的数据结构算法 在POJ上的题目 利用C++实现(Simple data structure algorithm in POJ on the subject using C++ Implementation)
    2010-05-04 19:03:45下载
    积分:1
  • SelectSort
    选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
    2012-09-27 22:38:22下载
    积分:1
  • Simulation-of-dendritic-growth
    模拟枝晶生长,在统计学常用的一种算法,对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)
    2012-04-06 19:12:14下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载