登录
首页 » Visual C++ » graph-DFS

graph-DFS

于 2013-10-27 发布 文件大小:1KB
0 302
下载积分: 1 下载次数: 4

代码说明:

  邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

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

发表评论

0 个回复

  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分:1
  • bahuanghouwenti
    八皇后问题,用vc编写了一个可以解决八皇后问题的程序,实现了递归调用。(The eight queens problem, using vc write a means of solving the eight queens problem program to achieve the recursive calls.)
    2009-09-10 17:59:25下载
    积分: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
  • Huffman
    程序可以实现哈弗曼自动编码功能!很详细的!很有参考价值!(Program can be Havermann automatic coding features! Very detailed! A good reference!)
    2010-07-21 22:06:48下载
    积分:1
  • zuixiaoshengchengshu
    最小生成树C语言程序,提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)
    2015-02-08 20:15:45下载
    积分:1
  • Numbersequence
    说明:  简单的数据结构算法 在POJ上的题目 利用C++实现(Simple data structure algorithm in POJ on the subject using C++ Implementation)
    2010-05-04 19:03:45下载
    积分:1
  • data-structure-paper
    本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
    2013-09-18 08:16:24下载
    积分:1
  • Maze
    c++用栈来实现迷宫求解(c语言数据结构)(c++ stack maze solving (c language data structure))
    2012-10-27 23:08:34下载
    积分:1
  • 9
    说明:  任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5) 输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式 例如,输入aybdx,则递归程序输出XaDyBbYdAx (Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
    2012-05-30 10:59:39下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载