搜索资源列表
017
- 广度优先搜索及深度优先搜索，用C语言实现，比较使用-Breadth-first search and depth first search, using C language, compared with
graph(linjiejuzhen)
- 基于C++模板，用邻接矩阵的方式，实现了基本的Graph(map)的构建，并实现了深度优先搜索和广度优先搜索，同时加入了测试用的数据读入和写入函数，便于调试和在本代码基础上进行进一步扩充。-Based on C++ templates, adjacency matrix, enabling a basic Graph (map) to build and achieve a depth-first search and breadth-first search, also joined the
dfs3
- 图的深度优先搜索算法，图的存储采用数组来模拟邻接表。-Graph depth-first search algorithm, Figure storage array used to simulate the adjacency table.
Sudoku-dengqiong
- 数独~~1、嵌套循环（最简单的行代码就解出来一个解） 2、深度优先搜索（将数独作为树节点，建立深度优先搜索树，也是只解一个解） 还有关于这个的设计~~~ -Sudoku- ~ 1, nested loops (the most simple lines of code out a solution on the solution) 2, depth-first search (to Sudoku as a tree node, to establish the depth-fi
Depth-first-search
- 深度优先搜索的搜索过程类似树的先序遍历，也叫回溯法。-Depth-first search of the search process similar to the preorder traversal of the tree, also known as backtracking.
Graph-traversal
- 图的遍历(含深度优先搜索与广度优先搜索，主函数)-Graph traversal (depth-first search and breadth-first search)
test2
- 数据结构 图的深度优先搜索遍历路径源代码-Data structure depth-first search through the source code path
graph
- 图的深度优先搜索遍历算法分析及其应用.pdf-woyu buhuia
1
- 深度优先搜索算法及其改进.pdf 深度优先搜索算法及其改进.pdf-shen du you xian suan fa shen du you xian suan fa
huisu
- 0-1背包问题的回溯法，如何用回溯（即深度优先搜索方法）来完成0-1背包问题-0-1Knapsacks Problem
Three
- recall.c：回溯法求有向图是否存在回路，将结果输出到文件中。dfs.c：深度优先搜索解决N皇后问题，结果输出到文件。Client.java：一个java编写的即时通讯小程序。-recall. depth-first search. Instant message.
graph
- 图的遍历，两种遍历，深度优先搜索遍历和广度优先搜索遍历算法-Traversal of the graph traversal, two traversal, depth-first search and breadth-first search traversal algorithm
5.21DFS
- 深度优先搜索实现的二叉树深度判断，源码在vc6.0下编译通过。-DFS searching to measure the depth of the binary tree.and the code is compilled successfully in VC6.0.
deep-first-searching
- 深度优先搜索实现的二叉树深度测量，源码在vc6.0下编译通过，运行稳定。-DFS searching to measure the depth of the binary tree.and the code is compilled successfully in VC6.0.
11
- 对于一个连通图G，请采用深度优先搜索的方法，识别出该连通图的所有关节点。如下图所示。 输入：首先输入连通图G的结点个数n、边的个数m以及搜索的起始结点号，然后输入各边（u,v）； 输出：首先输出DFN和LOW数组的值，然后输出所有关节点。-For a connected graph G, use depth first search method, identify the connected graph all key points. As below. Input: first
main
- 图的深度优先搜索和广度优先搜索以及一个无向图的拓扑排序-Graph depth-first search and breadth-first search and topological sorting of a directed graph
youxiangtuDFS
- 用C语言实现有向图的深度优先搜索功能源代码-Directed graph depth-first search function source code using the C language
graph-depth-first-search
- 基于VC6.0，实现图的深度优先搜索算法-graph depth-first search
sicily
- 关于图的广度优先搜索和深度优先搜索算法，结构体描述。还有二叉树的重建，根据先序和中序重构二叉树-DFS and BFS
Graphs_4
- 数据结构 无向图的邻接表 并按深度优先搜索结点-The data structure press the depth-first search node to the adjacency table