搜索资源列表
NineGrid
- 使用A*算法解决九宫问题,优于单一的深度优先或者广度优先算法-Jiugong using A* algorithm to solve the problem, than a single depth-first or breadth-first algorithm
language12-17casesofactual
- 实例12 简单的计算器 实例13 时钟程序 实例14 华氏温度和摄氏温度的相互转换 实例15 SimpleDebug函数应用 第2部分 数值计算与数据结构篇 实例16 常用的几种排序方法 实例17 广度优先搜索及深度优先搜索-Instance 12 Simple calculator Instance 13 Clock program Instance 14 Fahrenhe
cc
- 编写一个程序输出从顶点0开始的深度优先遍历序列(递归算法)和广度优先遍历序列(非递归算法)。-Write a program output from the vertex at 0 depth first traversal sequence (recursive algorithm) and breadth-first traversal sequence (non-recursive algorithm).
bianli
- 图的遍历,对有向图进行广度和深度优先遍历。-Graph traversal, directed graph on the breadth and depth-first traversal.
aaa
- 对任意给定的图(顶点数不小于20,边数不少于30,图的类型可以是有向图、无向图、有向网、无向网),能够输入图的顶点和边(或弧)的信息,并存储到相应存储结构(邻接矩阵、邻接表、十字链表、邻接多重表,任选其中两种类型),对自己所创建的图完成以下操作: 对无向图求每个顶点的度,或对有向图求每个顶点的入度和出度(5分) 完成插入顶点和边(或弧)的功能(5分) 完成删除顶点和边(或弧)的功能(5分) 两种存储结构的转换(5分),如果其中一种存储结构为十字链表或邻接多重表则增加5分。
rrrrrrr
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
tubianliyanshi
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
1
- 深度优先搜索 汇编语言 汇编数据结构 算法-Depth-first search algorithm for assembly language compilation of data structures
bashuma-shenduyouxian
- 采用深度优先算法求解八数码问题,绝对可以用-Algorithm using depth-first eight-puzzle problem can surely be
sr
- 商人过河问题是数学建模中的一个经典问题,程序利用链表存储渡河状态,使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案,但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索,二者在查找的思想上是类似的。-Mathematical modeling business across the river in question is a classic problem, the program memory to cross the river using the stat
Depth_FirstSearth
- 实现图的深度遍历 是一个深度优先算法 基于树的先跟遍历-Realize the depth chart is a depth-first traversal algorithm is based on the tree to begin with traversal
flow_trade
- 对一电力网络实现顺流跟踪,计算分流比例因子,深度优先搜索供电路径,计算发电机在负荷中的分配比例等。-Downstream of a power network tracking, triage scale factor calculation, depth-first search powered path, calculating the distribution of generators in the load ratio.
93939393939
- 数据结构中二叉树、堆栈、队列以及深度优先与广度优先算法实现-Binary tree data structure, stack, queue and the depth first and breadth-first algorithm
8_num
- 人工智能中通过深度优先搜索用C/C++实现八数码问题-Depth-first search to achieve 8 digital issues
tudeshenduyouxiansousuo
- 用图的遍历,邻接矩阵实现图的深度优先搜索,-Graph with adjacency matrix to achieve the depth-first search,
shenduyouxiansousuo(linjiebiao)
- 图的遍历,用邻接表实现图的深度优先搜索建的工程实现-Graph traversal, with the adjacency list graph depth-first search to achieve the construction of the project implementation
eclat.tar
- 很好的实现eclat算法的程序。A program to find frequent item sets (also closed and maximal) with the eclat algorithm (Zaki et al. 1997), which carries out a depth first search on the subset lattice and determines the support of item sets by intersecting transacti
tu121312
- 实现图的深度优先, 广度优先遍历算法,并输出原图结构及遍历结果。 初步完成总体设计,搭好框架; 最低要求:两种遍历都要实现,写出画图的思路; -Implementation of Depth-first, breadth-first traversal algorithm, and outputs the original image structure and the traversal result. Completed the initial design, and setting
tudebianli
- 实现图的深度优先, 广度优先遍历算法,并输出原图结构及遍历结果。 初步完成总体设计,搭好框架; 最低要求:两种遍历都要实现,写出画图的思路; 进一步要求:画出图的结构,有兴趣的同学可以进一步改进图的效果。 -Implementation of Depth-first, breadth-first traversal algorithm, and outputs the original image structure and the traversal result. Complet
fgwgg
- 关于图的深度优先遍历和广度优先遍历 方便易懂 很容易入手-Depth-first traversal on the graph and the breadth-first traversal is easy to start with easy to understand