Location:
Search - java bfs
Search list
Description: 这是一个基于BFS文件搜索的java代码-This is a document based on the BFS search java code
Platform: |
Size: 1654 |
Author: tdh |
Hits:
Description: java的DFS(Depth-first search )和BFS(Breadth-first search)的实现-the DFS (Depth-first search) and BFS (Breadth-first search) Implementation
Platform: |
Size: 6030 |
Author: Rachel |
Hits:
Description: java的DFS(Depth-first search )和BFS(Breadth-first search)的实现-the DFS (Depth-first search) and BFS (Breadth-first search) Implementation
Platform: |
Size: 6144 |
Author: Rachel |
Hits:
Description: BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
Platform: |
Size: 119808 |
Author: 李想 |
Hits:
Description: 九宫问题（八数码）的一个小软件，实现了多个程序的通讯解题和一套用BFS，双端BFS，A*搜索的分析程序。
rar中含一篇解题报告、软件、及netbeans源码。
环境是JDK1.5_6-JiuGongTu (Digital 8), a small software Implementation of a number of procedures and a set of communication to solve problems with BFS, double-BFS, A* search of analytical procedures. Rar Solution containing a report, software, and Netbeans source. The environment is JDK1.5_6
Platform: |
Size: 1235968 |
Author: wind |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
Platform: |
Size: 10240 |
Author: 丁如敏 |
Hits:
Description: 这是一个基于BFS文件搜索的java代码-This is a document based on the BFS search java code
Platform: |
Size: 1024 |
Author: tdh |
Hits:
Description: java program
Webmaster will activate your member account after checking your files. If you do not want to upload source code, you can join the [VIP member] to activate your account.
-java program
Webmaster will activate your member account after checking your files. If you do not want to upload source code, you can join the [VIP member] to activate your account.
Platform: |
Size: 1024 |
Author: bhushan |
Hits:
Description: This a solution of cavern problem using red black tree and DFS and BFS-This is a solution of cavern problem using red black tree and DFS and BFS
Platform: |
Size: 13312 |
Author: NeeL |
Hits:
Description: 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.
Platform: |
Size: 6144 |
Author: lyxh |
Hits:
Description: Implementations of a queue in C with algoritmo BFS, that calculates the minimum distance in a graph.
Platform: |
Size: 1024 |
Author: Joao |
Hits:
Description: depth first search algorithm
Platform: |
Size: 6144 |
Author: sha |
Hits:
Description: 广度优先搜索算法分析；供程序设计人员使用-Breadth-first search algorithm analysis for programmers to use
Platform: |
Size: 2037760 |
Author: 牛芳 |
Hits:
Description: This project solve 8 puzzle with breadth first search. I wrote this program for Artificial Intelligence lesson.
Platform: |
Size: 35840 |
Author: somatco |
Hits:
Description: Simple an example for BFS and DFS search
Platform: |
Size: 5120 |
Author: Celil |
Hits:
Description: 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
Platform: |
Size: 3769344 |
Author: benson |
Hits:
Description: java 数据结构 实现图的广度优先算法-Data structure of breadth first search in java
Platform: |
Size: 14336 |
Author: zq |
Hits:
Description: java program for data structure concept such as linked list ,concurrent queue ,shortest path alg ,BFS,DFS and etc
Platform: |
Size: 589824 |
Author: revathi |
Hits:
Description: PROGRAMS FOR BFS, DFS DIJIKSTRA AND TOPOLOGICAL SORT ARE AVAILABLE WRITTEN IN JAVA AND RESPECTIVE OUTPUT IS ATTACHED WITH EACH PROGRAM TO MAKE IT AVAILABLE
Platform: |
Size: 65536 |
Author: jeni |
Hits:
Description: java环境下采用广度优先搜索来求解8-puzzle、8-queen等智能问题
-By using BFS java environment to solve the 8-puzzle, 8-queen, intelligent problem
Platform: |
Size: 18432 |
Author: 夏益志 |
Hits: