搜索资源列表
Wrox.Professional.ASP.NET.2.0.Databases.Feb.2007.eBook-BBL
- Who This Book Is For This book is aimed at intermediate or experienced programmers who have started on their journey toward ASP.NET development and who are already familiar with relational databases such as SQL Server. While readers won’t be intro
sudoku1
- 数独求解代码，用深度优先搜索数独问题的解，求得唯一解-Solving Sudoku code, using depth-first search solution Sudoku problem, find a unique solution
minop
- 最少运算问题 主要是深度优先搜索迭代加深的运用-At least the problem is that computing depth-first search Iterative deepening the use of
wuxiangtu3
- 无向图的深度优先搜索 无向图的深度优先搜索 无向图的深度优先搜索 -Undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph of the depth-first search
square
- 给你n根木棒，请问使用这些木棒，是否有可能让它们头尾相连组成一个正方形？所 有的木棒都必须使用。 深度优先搜索的正方形问题-N root stick to you, will use the stick, is it possible so that they linked to the formation of a square head? All must use the stick. Depth-first search of the square problem
main
- poj2676:sudoku.深度优先搜索和剪枝.正确程序.-poj2676:sudoku.Depth First Search.Accepted program.
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
AIDFS
- 实现C#深度优先搜索七巧板程序,完成七巧板深度优先搜索的解答，算法对固定图效果还好-depth first search DFS AI
mataqipan
- 深度优先搜索遍历地"马踏棋盘"，代码实现-Depth-first search traversal to " horse riding board" , code
prologSearch
- Implementing Search in Prolog. How to represent the problem Uninformed Search depth first breadth first iterative deepening search Informed Search Hill climbing Graph Search
mfc_socket_tree
- 客户端用MFC写的。客户端输入起点和终点和路长。服务器就会生成深度优先二叉树。还在客户端上显示树状结构-Client written using MFC. Client input start and end points and long road. The server will generate a depth-first binary tree. Also displayed on the client tree
Ubuntu-source-Definitive-Guide
- 《Ubuntu权威指南》首先介绍Ubuntu Linux系统的安装与GNOME桌面环境，然后从基本命令行入手，由浅入深，逐步阐述Linux系统的基本概念与原理，同时给出大量的应用实例。在此基础上，对Linux系统的各种文件系统、Shell编程、进程管理、软件管理、磁盘空间管理、用户管理、系统启动过程、作业调度与系统日志、TCP/IP网络管理与应用、OpenSSH、DNS、NFS、Samba、Apache服务器与MySQL数据库等方面进行了深入的讨论。 《Ubuntu权威指南》内容丰富，语言流
mataqipan
- 深度优先搜索遍历地"马踏棋盘"，代码实现-Depth-first search traversal to " horse riding board" , code
square
- 给你n根木棒，请问使用这些木棒，是否有可能让它们头尾相连组成一个正方形？所有的木棒都必须使用。深度优先搜索的正方形问题-N root stick to you, will use the stick, is it possible so that they linked to the formation of a square head? All must use the stick. Depth-first search of the square problem
ergodic
- 1） 使用邻接矩阵和邻接表储表示分别实现如下给定的图1、图2、图3所示图的物理存储结构。 2） 在1）所建立的图形存储结构上分别实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 -1) Use an adjacency matrix and adjacency table represent savings realized as 1, 2, given the physical storage structure diagram shown in Figure 3. F
Light_XML_Encoding_deconding
- 将树形数据结构用于最小化 DOM 模型 XML 编解码器的开发。在解析 XML 文本时，基于 Expat 解释器将 XML 字符串构造成树 状结构；编码时构造 DOM 树结构，采用非递归深度优先法遍历树，将其串行化成 XML 串。本编解码器解决了国际化语言关键问题，是 一个通用、高效的工业级 XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based e
66910315
- 载入txt文件迷宫,含几种搜索方法,例如depth first search, breadth first search等()
最小生成树
- 本文件包含最小生成树程序，深度优先搜索，广度优先搜索，prim算法等，满足对树状图学习的小伙伴们下载，绝对是良心推荐，可以直接运行程序。(This file contains minimum spanning tree program, depth first search, breadth first search, PRIM algorithm, etc., which satisfies the downloads of tree learning partners. It is abso