登录
首页 » Visual C++ » Cpp1

Cpp1

于 2012-06-20 发布 文件大小:2KB
0 221
下载积分: 1 下载次数: 2

代码说明:

  校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)

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

发表评论

0 个回复

  • NoGo
    计算机博弈大赛不围棋的代码 个人所写,可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
    2021-04-04 19:39:04下载
    积分:1
  • Maze
    c++用栈来实现迷宫求解(c语言数据结构)(c++ stack maze solving (c language data structure))
    2012-10-27 23:08:34下载
    积分:1
  • K_Merge
    文件的多路归并排序算法, C++描述(要求待排序文件已经事先有序)(C++ implementation of K-Merge Algorithm)
    2010-08-03 10:24: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
  • CAR
    some problems about c++.(car.cpp)
    2012-01-12 14:39:48下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • migongproduce
    迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
    2012-02-10 15:17:36下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • Dijkstra
    迪特斯特拉算法,课程设计的作品,主要计算站点距离的吧,可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)
    2013-04-11 10:26:15下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载