登录
首页 » C++ Builder » DFS

DFS

于 2013-06-17 发布 文件大小:550KB
0 153
下载积分: 1 下载次数: 1

代码说明:

  peymayesh dfs graph ba zaban c++

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

发表评论

0 个回复

  • dynamic-programming
    用动态规划法求两个字符串 A="xzyzzyx"和 B =”zxyyzxz“的最长公共子序列(For two strings A dynamic programming method = " xzyzzyx" and B = " zxyyzxz" the longest common subsequence)
    2014-02-24 14:35:23下载
    积分:1
  • stock
    在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。 (Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores.)
    2007-12-25 00:34:14下载
    积分:1
  • josephus
    说明:  约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
    2011-04-13 16:43:47下载
    积分:1
  • tudebianli
    图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书(yrteryryer)
    2010-05-08 09:24:06下载
    积分:1
  • shu
    大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)
    2017-11-10 13:44:35下载
    积分:1
  • deduplication
    C语言实现的simhash算法,用于文章查重!(Simhash algorithm C language, and re-check for the article!)
    2020-07-01 01:20:02下载
    积分:1
  • bstree_frame
    利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
    2013-08-10 16:43:50下载
    积分:1
  • class
    给定m个n维向量a , a , ,am 1 2  ,向量分类问题要求将相同的向量划分为同一类。试用 抽象数据类型表设计解向量分类问题的有效算法。(Given m a n-dimensional vector a, a,, am 1 2 )
    2008-05-05 22:03:41下载
    积分: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
  • Maze
    IEEE电脑鼠走迷宫程序(带有记忆功能和智能算法)(IEEE Computer Mouse Maze procedure (with memory function and intelligence algorithm))
    2010-03-12 20:51:23下载
    积分:1
  • 696518资源总数
  • 105949会员总数
  • 22今日下载