Location:
Search - BFS P
Search list
Description: 中南大学算法分析PPT
使用课本《算法设计与分析基础》影印版
英文资料-Zhongnan University PPT analysis algorithm used textbooks, "Design and Analysis of Algorithms based on" English version photocopying
Platform: |
Size: 634880 |
Author: 光光 |
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: 规范 BFS 写法，可以有效地避免一些状态判重和状态转移上的细节错误，使用优先队列，这里不用优先队列会错。-BFS written specification, can effectively avoid the details of some of the state and the state transition heavy sentence on the error, use the priority queue, priority queues are not wrong here.
Platform: |
Size: 1024 |
Author: 赵霞娟 |
Hits:
Description: 最短路中的广度优先搜索，Dijkstra算法。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。题目是：给定一个带权重的有向图 G (V,E)，V 为顶点集，E 为有向边集，每一条有向边均有一个权 重。对于给定的顶点 s、t，以及 V 的子集 V ，寻找从 s 到 t 的不成环有向路径 P，使得 P 经过 V 中所有的顶点(对经过 V 中节点的顺序不做要求)。
若不存在这样的有向路径 P，则输出无解，程序运行时间越短，则视为结果越优；若存在这 样的有向路径 P，则输出所得到的路径，路径的权重越小，则视为结果越优，在输出路径权 重一样的前提下，程序运行时间越短，则视为结果越优。-Shortest in the BFS, Dijkstra algorithm. Better network algorithm calculates a path for network problems to achieve efficient allocation of resources of great value. Title is: Given a weighted directed graph G (V, E), V is the set of vertices, E is set to have the edge, each side has to have a weight. For a given vertex s, t, and V subset V , looking s to t acyclic directed path P, such that P through V in all vertices (elapsed V nodes in order not to Claim).
If there is a directed path P, the output is no solution, the shorter the time the program runs, the more the result is considered excellent if there is a directed path P, the resulting output path, the path of the right weight is smaller, it is considered more excellent results in the output path weight the same premise, the shorter the time the program runs, the more the result is considered excellent.
Platform: |
Size: 21504 |
Author: wangwanwan |
Hits: