Description: 我编写的几个图论代码，包括深搜、最小生成树、最短路径，注释我写的很详细，大家可以作为入门参考。-I prepared a number of graph theory code, including deep search, minimum spanning tree, shortest path, notes I wrote in great detail, we can serve as a reference entry. Platform: |
Size: 3072 |
Author:彭立勋 |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。-Graph Theory Algorithm Library C++ Language code realize the contents of graph theory algorithm library, which includes the following algorithms: single-source shortest path Dijkstra algorithm for single-source shortest path Bellman-Ford algorithm Prim minimum spanning tree algorithm between each pair of nodes Flod-Warshall shortest path algorithm Language C++ compiler platform VisualAge C++ 4.0 Author starfish (starfish.h @ china.com) Remarks procedures used C++ language in VisualAge C++ 4.0 debugging through. Platform: |
Size: 1024 |
Author:王兵 |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program Platform: |
Size: 5120 |
Author:任龙 |
Hits:
Description: dijkstra算法，可以求解图论中的两点间最短路径-Dijkstra algorithm, can solve the graph theory in the shortest path between two points Platform: |
Size: 1024 |
Author:晞睿 |
Hits:
Description: 利用深度优先搜索算法和广度优先搜索算法解决图论中最短路问题-Use depth-first search algorithm and the breadth-first search algorithm in graph theory to solve the shortest path problem Platform: |
Size: 55296 |
Author:张一 |
Hits:
Description: 最短路径的matlab文件，最短路径无论是在数据结构还是在图论中，都占有比较重要的地位-The shortest path of matlab files, shortest path, whether in data structures or graph theory has played an important role compared Platform: |
Size: 3072 |
Author:小明 |
Hits:
Description: 求图论中的最短路径，哈哈求图论中的最短路径，-Graph theory for the shortest path in graph theory Haha seeking the shortest path, ha ha ... ... Platform: |
Size: 6144 |
Author:fbr |
Hits:
Description: folyd用来处理图论中最短路径问题。对传统的folyd算法进行了优化。-folyd to deal with the shortest path in graph theory problem. Folyd the traditional optimization algorithm. Platform: |
Size: 3633152 |
Author:风清扬 |
Hits:
Description: 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem Platform: |
Size: 4096 |
Author:luoyong |
Hits:
Description: floyd算法，用于图论中的最短路算法，使用matlab编写，简单实用-floyd algorithm for the shortest path in graph theory algorithms, using matlab to prepare, simple and practical Platform: |
Size: 3072 |
Author:封宇 |
Hits:
Description: In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this.-In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this. Platform: |
Size: 70656 |
Author:kassi |
Hits:
Description: 在图论的最短路问题中，我们经常用到floyd和Dijkstra来解决问题-In graph theory, shortest path problem, we often use the floyd and Dijkstra to solve the problem Platform: |
Size: 1024 |
Author:小虾郭 |
Hits:
Description: 这个代码最要是实现最短路径问题，最短路径问题是图论中的一个很重要问题-This code the most if the shortest path problem, shortest path problem is a very important problem in graph theory Platform: |
Size: 1024 |
Author:haha |
Hits:
Description: 《游戏人工智能编程案例精粹》主要讲述如何使游戏中的角色具有智能的技术。书中首先介绍游戏角色的基本属性（包括速度、质量等物理属性）及常用数学方法。接着，深入探讨游戏智能体状态机的实现。通过简单足球游戏实例，《游戏人工智能编程案例精粹》给出用状态机实现游戏AI的例子。在图论部分，《游戏人工智能编程案例精粹》详细介绍图在游戏中的用途及各种不同的图搜索算法，并用一章的篇幅讨论了游戏中路径规划是如何完成的。此外，《游戏人工智能编程案例精粹》还对目标驱动的智能体的实现、触发器与模糊逻辑在游戏中的运用进行了讨论。为使智能体行为更加丰富、灵活、易于实现，《游戏人工智能编程案例精粹》还介绍了游戏脚本语言的优点，并以Lua脚本语言为例进行了说明。-" Game Artificial Intelligence Programming Case essence" , focuses on how to make the characters in the game with intelligent technology. The book first introduces the basic attributes of the game characters (including the speed, quality, and other physical attributes) and commonly used mathematical methods. Then, depth game agent realization of the state machine. Instance through a simple football game, the game artificial intelligence programming case the essence of the game AI examples given state machine. Part in graph theory, game artificial intelligence programming case essence " detailed diagram of purpose in the game, and a variety of graph search algorithms, and discuss the game path planning is completed with a chapter. In addition, the game artificial intelligence programming case essence " the realization of the goal-driven agents trigger fuzzy logic game discussion. Agent behavior more rich, flexible, and easy to implement, game artificial intelligence prog Platform: |
Size: 15479808 |
Author:白栋天 |
Hits:
Description: 图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法，而并行遗传算法是遗传算法研究中的一个重要方向，受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many problems. Many problems can be translated into graph theory problems, and then solved by the basic algorithm of graph theory. Genetic algorithm is an efficient algorithm for solving optimization problems, and parallel genetic algorithm is an important direction of genetic algorithm research, and has attracted much attention of researchers.) Platform: |
Size: 27648 |
Author:四姑娘
|
Hits:
Search - path in graph theory