搜索资源列表
dfs
- 深度搜索算法用于一幅二值图像,指定开始点和目标点-deep first search method is used for binary image,with assigned start and end point
Main
- RFID模擬TAG跟READER之間通訊的程式 用來模擬防碰撞機制DFS跟QTA兩種演算法 為於研判RFID TAG-COLLISION問題的人應該有些幫助-READER simulated RFID communication between TAG with the program used to simulate the anti-collision mechanism QTA with DFS in the study of two algorithms for RFID TAG
DfsColoring
- DFS COLORING WITH NEW METHOD
hdfs
- 基于Java的Hadoop分布式文件系统-Hadoop dfs
4.1
- 采用图的邻接表作为图的存储结构,完成有向图和无向图的DFS和BFS操作-The use of maps as a chart table adjacent to the storage structure, the completion of directed graph and undirected graph operations of DFS and BFS
disanti
- (1)自选存储结构,输入含n个顶点(用字符表示顶点名称)和e条边的图G; (2)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS(深度优先)顶点序列(提示:使用栈实现DFS); (3)指定任意顶点x为初始顶点,对图G作BFS(广度遍历),输出BFS顶点序列(提示:使用队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及与之相关连的边,并作DFS遍历(执行操作3);否则输出信息“不存在x”; (6)判断图G是否是连通图,输出信息“YES”/“NO
LTDT5
- demo BFS,DFS algorithm
xbfx
- 本章重点: 1.离散信号的概念 2.离散信号的运算 3.离散系统的概念 4.离散周期信号的傅立叶级数(DFS) 5.离散非周期信号的傅立叶变换(频谱密度函数DTFT) 6.简单的滤波器(简介) -This chapter focuses: 1. The concept of discrete signal 2. Discrete signal computing 3. The concept of discrete-time systems 4. Discrete F
GraphDFS
- 应用深度优先遍历法访问无向图,采用了递归调用法和栈两种方法实现,很好的对比实现了算法-Use the means of DFS to visit undiction graph
DFS
- 無向圖+array of linked list製成 歡迎參考-nondirected, array of linked list
DFS-BFS
- BEST FIRST SEARCH AND DEEP FIRST SEARCH
Windows7abc
- 我们的开发是最好的,欢迎大家前来下载。我会做得最好的-dfs
dfs
- 搜索教案。很不错的,对于ACM初学者十分有帮助。-Search for lesson plans. Very good for beginners ACM very helpful.
CityRoad-report
- 城市道路问题的DFS用递归和非递归写的代码和一份解题报告-The issue of urban road with the DFS recursive and non-recursive code written report and a problem-solving
6-5P
- DFS Search in Graph . Depth First Search
Graph_Traversal_DFS_and_BFS
- Graph Traversal,DFS and BFS
erchashu
- 本文利用C语言实现了简单的二叉树,每个结点只保存一个整数,并且,由于非常简单,树的根结点是确定的,而不是输入的。确定根结点以后,用户输入的每一个数都被insert到树中(-999表示停止),利用深度优先的方法。建立好二 叉 树以后,分别利用深度优先(DFS)和广度优先(BFS)进行了遍历,输出结果。-In this paper, the use of C language realization of a simple binary tree, each node only maintains
dfssamples
- 朴素的没有优化过的dfs 题目有:借书问题,骑士的游历,迷宫问题,细胞个数-There is no simple optimized dfs topics: library issues, Knight' s tour, the maze problem, the cell number
44
- 44键盘p实体设计,后继还有文件,暂时还未上来-aaaa bbbbb ccccc wwwwww df dfafd safdsa dfdsf dfdf dfs e f dsf saaf a afa f a f df a af af af
DFSListView(D2007)
- DFSListView(D2007) DFSListView(D2007) -DFSListView (D2007) DFSListView (D2007)