Search - DFS

Search - DFS - List

【Algorithm】 1 DL : 0: 中南赛区ACM竞赛题这题可以用Dijkstra的算法做,但是dfs的时间加减枝后也只有15ms,我用的是dfs. 就是遍历每种可行的树,要求每个棵树上的节点的地位都在maxdw,mindw,(最大地位,最小地位)的范围内.-ACM South Division title race this title Dijkstra
Update : 2024-05-03 Size : 1024 Publisher : 王建华
【Data structs】 tu-matrix DL : 0: 图可以采用邻接矩阵、邻接表等多种方式来存储，本程序实现图的邻接矩阵存储-Chart can be used adjacency matrix, adjacency lists to store a variety of ways, this program graph adjacency matrix storage
Update : 2024-05-03 Size : 1024 Publisher : youjing
【Data structs】 main DL : 0: 八皇后问题解法,包括DFS,BFS和INF三种解法-8 Queen
Update : 2024-05-03 Size : 2048 Publisher : fangming
【matlab】 ck_conty DL : 0: ck_conty为判断图的连通性的matlab mex文件，另附带包含BFS和DFS的C源程序-ck_conty for judging connectivity map matlab mex file, and the other side contains the BFS and DFS
Update : 2024-05-03 Size : 3072 Publisher : xuyanbo
【Data structs】 DSchen DL : 0: 二叉树建立，先序，中序，后序遍历，图的DFS，BFS演示程序，不断更新中，欢迎提建议-Tree establishment, the first order, in sequence, after the traversal, graph DFS, BFS presentation procedures, constantly updated, welcomed the proposals
Update : 2024-05-03 Size : 2078720 Publisher : emacochen
【VHDL-FPGA-Verilog】 DDR_SDRAM_controller DL : 0: DDR SDRAM控制器的VHDL源代码，含详细设计文档。 The DDR, DCM, and SelectI/O™ features in the Virtex™ -II architecture make it the perfect choice for implementing a controller of a Double Data Rate (DDR) SDRAM. The Digital Clock Manager (DCM) provides the required Delay Locked Loop (DLL), Digital Phase Shift (DPS), and Digital Frequency Synthesis (DFS) functions. This application note describes a controller design for a 16-bit DDR SDRAM. The application note and reference design are enhanced versions of XAPP200 targeted to the Virtex-II series of FPGAs. At a clock rate of 133 MHz, 16-bit data changes at both clock edges. The reference design is fully synthesizable and achieves 133 MHz performance with automatic place and route tools.-DDR SDRAM controller VHDL source code, including detailed design documents. The DDR, DCM, and SelectI/O
Update : 2024-05-03 Size : 132096 Publisher : xbl
【Data structs】 code DL : 0: 1、猴子选大王 2、约瑟夫环 3、迷宫求解 4、回文游戏 5、地图四染色问题 6、八皇后问题 7、原四则表达式求值 8、k阶斐波那契序列 9、遍历二叉树 10、编写DFS算法的非递归函数。编写BFS算法。 11、简单选择排序，折半插入排序，冒泡排序，快速排序，堆排序 12、顺序查找，折半查找-err
Update : 2024-05-03 Size : 34816 Publisher : isxzh
【Other】 getallip DL : 0: 易wmi取所有网卡ipdsdf dfs df-Wmi easy access to all card ipdsdf dfs df
Update : 2024-05-03 Size : 2048 Publisher : koma
【Data structs】 qishi DL : 0: void Knight(int i , int j) { // printf("％d ％dn",i,j) if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size ) { return } step++ board[i][j]=step if (step == Size*Size) { showboard() system("PAUSE") return } //DFS Knight(i-2,j-1) //left Knight(i-2,j+1) Knight(i+2,j-1) //right Knight(i+2,j+1) Knight(i-1,j-2) //up Knight(i+1,j-2) Knight(i+1,j+2) //down Knight(i-1,j+2) // board[i][j]=0 step-- }-void Knight (int i, int j) (//printf ( d dn , i, j) if (board [i] [j]! = 0 | | i <0 | | i> = Size | | j <0 | | j> = Size) (return) step++ board [i] [j] = step if (step == Size* Size) (showboard () system ( PAUSE ) return)// DFSKnight (i-2, j-1)// leftKnight (i-2, j+ 1) Knight (i+ 2, j-1)// rightKnight (i+ 2, j+ 1) Knight (i-1, j-2)// upKnight (i+ 1, j-2) Knight (i+ 1, j+ 2)// downKnight (i-1, j+ 2)// board [i] [j] = 0 step--)
Update : 2024-05-03 Size : 3072 Publisher : json
【Data structs】 TDJB DL : 0: 1)自选存储结构,输入含n个顶点（用字符表示顶点）和e 条边的图G； (2)求每个顶点的度,输出结果； (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS)； (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS)； (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及与之相关连的边,并作DFS遍历(执行操作3)；否则输出信息“无x”； (6)判断图G是否是连通图，输出信息“YES”/“NO”； (7)如果选用的存储结构是邻接矩阵,则用邻接矩阵的信息生成图G的邻接表,即复制图G,然再执行操作(2)；反之亦然。 -err
Update : 2024-05-03 Size : 242688 Publisher : 迟浩东
【OS program】 Iterative_1666161122003 DL : 0: DFS here If you have not registered, Please [regist first].You should upload at least five sourcecodes/documents. (upload 5 files, you can download 200 files). Webmaster will activate the Member Account after checking your files. If you do not want to upload source code, you can join the [VIP member] to get account. -DFS here If you have not registered, Please [regist first].You should upload at least five sourcecodes/documents. (upload 5 files, you can download 200 files). Webmaster will activate the Member Account after checking your files. If you do not want to upload source code, you can join the [VIP member] to get account.
Update : 2024-05-03 Size : 10240 Publisher : jerthere
【Other systems】 dfs[1].ITracker_2008 DL : 0: its it tracker and used for track
Update : 2024-05-03 Size : 967680 Publisher : rkj
【Algorithm】 lagrange DL : 0: 进行快速拉格朗日插值，方便对大量数据逼近函数-jgkljdsjpotweogj lsj jgfdsopiriew[iotrwejjgl dfs jkgoer[w
Update : 2024-05-03 Size : 1024 Publisher : tangwencheng
【Windows Develop】 DFSCrawler DL : 0: I ve made an application that crawling the web base on DFS algorithm. Thanks.
Update : 2024-05-03 Size : 414720 Publisher : DungDX
【Mathimatics-Numerical algorithms】 ACM_ICPC_Search__By_ACMaryland DL : 0: ppt about search(bfs && dfs) used in ACM_ICPC
Update : 2024-05-03 Size : 538624 Publisher : HuaXiong
【Graph program】 dfs DL : 0: 深度搜索算法用于一幅二值图像，指定开始点和目标点-deep first search method is used for binary image,with assigned start and end point
Update : 2024-05-03 Size : 1024 Publisher : 刘新
【RFID】 Main DL : 0: 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-COLLISION issues should be some help
Update : 2024-05-03 Size : 2048 Publisher : cdvf
【JSP/Java】 bfs-src DL : 0: 1.程序基于java语言。运行要求java运行环境。即就使jdk1.2以上。否则程序无法运行。 2.程序中读图时，可以选择读有向图还是无向图。 3.本程序为一个图的综合运行环境。提供了图的各种操作。包括读图，DFS判断图中是否存在环路，BFS全局访问，两点之间的最短路径，屏幕清空。并且跟踪说明了图的各种操作的过程。 4.程序可以多次的读图，进行图的各种操作。点击面板上的各种按钮就可以进行各种操作。-1. Procedures based on the java language. Java runtime environment operational requirements. That makes more than jdk1.2. Otherwise, the procedure can not run. 2.读图process, you can choose to read or a directed graph undirected graph. 3. This procedure is a map of the integrated operating environment. Provides a map of the various operations. Including读图, DFS diagram to determine the existence of loops, BFS overall visit to the shortest path between two points, the screen cleared. And tracking map shows the course of the various operations. 4.读图can be repeated for a variety of operating plans. Click on the various buttons on the panel can conduct various kinds of operation.
Update : 2024-05-03 Size : 6144 Publisher : lyxh
【Data structs】 DFS DL : 0: 深度优先算法，用深度优先来遍历树结构，能够取得很好的复杂度-Depth-first algorithm, using depth-first traversal tree structure to achieve a good complexity
Update : 2024-05-03 Size : 1024 Publisher : xuhaifeng
【Other】 DfsColoring DL : 0: DFS COLORING WITH NEW METHOD
Update : 2024-05-03 Size : 2048 Publisher : HABIL

« 1 2 ... 5 6 7 8 9 1011 12 13 14 15 ... 25 »