Search - search shortest path

Search - search shortest path - List

[AI-NN-PR] zhangzhiguang2 DL : 0: 用势场法的原理实现的vc搜索最短路径程序，改进后的势场法，实用。-with potential field of realization of the principle of shortest path vc search procedures, improving the potential field and practical.
Date : 2026-01-11 Size : 57kb User : 安黎
[AI-NN-PR] TravelingSalesmanProblemwithGeneticAlgorithm DL : 0: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value
Date : 2026-01-11 Size : 4kb User : 宏姬
[AI-NN-PR] A-star(vb) DL : 0: 初学A*算法的很好源码，基于最短路径规则-Novice A* algorithm is a good source, based on the shortest path rules
Date : 2026-01-11 Size : 5kb User : 杨羽
[AI-NN-PR] dijkstra-java DL : 0: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work.
Date : 2026-01-11 Size : 1kb User : kivilin
[AI-NN-PR] dijkstra-c++ DL : 0: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 c#实现算法-Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work. c# algorithm
Date : 2026-01-11 Size : 2kb User : kivilin
[AI-NN-PR] guangdusousuo DL : 0: 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of important plans of the prototype algorithm. Single-source Dijkstra shortest path algorithm and Prim minimum spanning tree algorithm has been adopted and breadth-first search for a similar idea
Date : 2026-01-11 Size : 164kb User : 光远
[AI-NN-PR] rengongzhineng DL : 0: 利用图搜索技术求解状态图中任意两点的路径和最短路径，并利用这种方法解决旅行商问题-Use map search technology to solve any two points in the state diagram of the path and the shortest path, and take advantage of this approach to solve traveling salesman problem
Date : 2026-01-11 Size : 29kb User : 川原
[AI-NN-PR] search DL : 0: 迷宫搜索，A*算法，自动生成迷宫矩阵，查找最短路径-Maze search, A* algorithm, automatic generation of matrix maze to find the shortest path
Date : 2026-01-11 Size : 621kb User : 梁旭
[AI-NN-PR] eightnumber DL : 0: 人工智能的期末课程设计，实现了AI部分，用启发式搜索查找最短路径-Artificial intelligence at the end of curriculum design, the realization of part of the AI, using heuristic search to find the shortest path
Date : 2026-01-11 Size : 724kb User : 朱建杰
[AI-NN-PR] bashuma DL : 0: 用三种不同的搜索算法解决八数码问题，使得通过最短的路径和最小的消耗到达目标状态。-Three different search algorithms to solve the problem eight digital, making the shortest path and minimum through the consumption of the state to reach the target.
Date : 2026-01-11 Size : 346kb User : starryshi
[AI-NN-PR] An-algorithm--based-on-PCNN-model DL : 0: 本文根据脉冲耦合神经网络（PCNN）并行运行的特点，提出了基于PCNN 模型的迷宫最短路径搜索算法。从理论上对该算法进行了分析和讨论，并给出了具体的算法和实验结果，验证了该方法的有效性。与其他算法相比，该方法可以在最短的时间内完成最短路径的搜索。-Based on Pulse Coupled Neural Network (PCNN) run in parallel the characteristics of PCNN model is proposed based on the shortest path maze searching algorithm. In theory the algorithm is analyzed and discussed, and given a specific algorithm and experimental results verify the effectiveness of the method. Compared with other algorithms, the method can be completed within the shortest possible time the shortest path search.
Date : 2026-01-11 Size : 339kb User : wangxx
[AI-NN-PR] Ant-colony-algorithm- DL : 0: 本文件里描述了用蚁群算法寻找最短路径的方法，以及相应的搜索路线图形表示-This document describes the use of ant colony algorithm to find the shortest path method, and the corresponding graphical representation of the search line
Date : 2026-01-11 Size : 89kb User : 加俊
[AI-NN-PR] ACO DL : 0: 蚁群算法，其中D为最短距离矩阵，可以高效地实现最优化路径的搜索。-Ant colony algorithm, where D is the shortest distance matrix, can efficiently achieve the most optimal path search.
Date : 2026-01-11 Size : 1kb User : 静
[AI-NN-PR] Maze DL : 0: 电脑鼠走迷宫程序，实现自动寻径，搜索最短路径等功能。是一个初期的程序。-Computer Mouse Maze procedure , automatic routing , search shortest path .
Date : 2026-01-11 Size : 106kb User : 丫头
[AI-NN-PR] 蚁群算法c语言 DL : 0: 使用30只蚂蚁搜寻走完100个城市的最短路径，平均搜寻30次之后能够找到目前最短路径(30 ants are used to search for the shortest path of 100 cities, and the shortest path can be found after an average of 30 searches.)
Date : 2026-01-11 Size : 48kb User : 兰的月光