登录
首页 » Visual C++ » 017

017

于 2011-07-09 发布 文件大小:2KB
0 214
下载积分: 1 下载次数: 3

代码说明:

   广度优先搜索及深度优先搜索,用C语言实现,比较使用(Breadth-first search and depth first search, using C language, compared with)

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

发表评论

0 个回复

  • xianxinglianbiao
    c语言编写链式线性表的初始化,创建,插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
    2013-11-09 14:30:30下载
    积分:1
  • 第4章
    清华大学出版社,数据结构简明教程李春葆著,第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)
    2018-02-03 14:39:12下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • POJ2371
    PKU ONLINEJUDGE 2371
    2011-10-21 15:03:03下载
    积分:1
  • Is_BST
    This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
    2012-02-02 05:45:59下载
    积分:1
  • Dijlstra
    Dijlstra算法 对任意图,选择合适的数据结构表示图,在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)
    2009-01-11 19:03:11下载
    积分:1
  • chazhao
    数据结构课程作业,查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
    2009-07-08 02:41:51下载
    积分:1
  • 5-source--code-of-DS--PRO
    数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
    2011-05-18 17:01:17下载
    积分:1
  • 最短路径c++语言
    说明:  用从c++写的floyd最短路径算法,可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)
    2020-09-20 14:07:55下载
    积分:1
  • suanfa
    匈牙利算法以及指派问题介绍,kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
    2011-09-10 09:42:39下载
    积分:1
  • 696518资源总数
  • 106222会员总数
  • 14今日下载