Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - dij

Search list

[Other resource] dij

Description: Dij算法 图论里面的 可以用来计算最短路径
Platform: | Size: 1027 | Author: 康平 | Hits:

[Data structs] dij

Description: Dij算法 图论里面的 可以用来计算最短路径-Dij algorithm graph theory which can be used to calculate the shortest path
Platform: | Size: 1024 | Author: 康平 | Hits:

[Data structs] src

Description: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search
Platform: | Size: 77824 | Author: 俞昊旻 | Hits:

[Data structs] dij

Description: 这是一个将Dijkstra算法的时间复杂度从O(n*n) 优化为O(nlogn)的方法-This method can reduce time complexity from O(n*n) to O(nlogn) for Dijkstra s algorithm.
Platform: | Size: 17408 | Author: 秦天 | Hits:

[JSP/Java] JAVA--dij

Description: 用JAVA实现的一种DIJ算法过程，代码经典，可扩展性强-JAVA achieved with a process of DIJ algorithm, code classic, scalability and strong
Platform: | Size: 17408 | Author: 陈国章 | Hits:

[Mathimatics-Numerical algorithms] SA_TSP

Description: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。-TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], which said dij city i to city j the distance, i, j = 1, 2 ... n, the problem is to identify each city exactly once visited a loop and make it to the shortest path length.
Platform: | Size: 268288 | Author: 章为到 | Hits:

[Other] dij

Description: dijkstra,每一对顶点间的最短距离-dijkstra, each pair of vertices the shortest distance between the
Platform: | Size: 1098752 | Author: wiiliam.tony | Hits:

[Mathimatics-Numerical algorithms] shortestpath

Description: 利用迪杰斯特拉算法和弗洛伊德算法计算两节点之间的最短路径-get the shortest path between two node with arithmetic of DIJ and floyd
Platform: | Size: 2048 | Author: Alias_y | Hits:

[Other] travel-system

Description: 模拟旅游查询系统，使用dij算法实现最短路程序，实现最小价格、最小时间、限时最小价格-Simulated travel inquiry system, using dij algorithm
Platform: | Size: 924672 | Author: houxionghui | Hits:

[AI-NN-PR] ant

Description: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短-TSP (Travelling Salesman Problem, abbreviated TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], where dij that city i to city j the distance, i, j = 1, 2 ... n, then the problem is to find out I visited each city exactly once and make a loop for the shortest path length
Platform: | Size: 6144 | Author: hepeng | Hits:

[JSP/Java] dij

Description: This is a dijkstra algorith.
Platform: | Size: 1024 | Author: asdfg | Hits:

[Mathimatics-Numerical algorithms] dij

Description: 迪吉斯特拉算法,fsdfds fds fds fds fsdfds-迪吉斯特拉 algorithm:
Platform: | Size: 1024 | Author: eason | Hits:

[Other] dij(2)

Description: 迪克斯特拉算法 迪克斯特拉算法-fasdfgdh
Platform: | Size: 2048 | Author: jeon | Hits:

[Data structs] Dij

Description: zui duan lu de ji ben suan fa
Platform: | Size: 1024 | Author: xuexue | Hits:

[Data structs] DIJ

Description: 迪杰斯特拉算法是数据结构中一实验算法。用vs2008编写,已无错误-Dijkstra algorithm is an experimental algorithm for data structure
Platform: | Size: 1024 | Author: fff | Hits:

[JSP/Java] Dij

Description: Simulation of Dijkstra s algorithm.
Platform: | Size: 276480 | Author: Manoj Kumar | Hits:

[FlashMX] dij

Description: A*寻路算法 FLASH 编写 只是简单的功能 不适合高级别的人来阅读 适合初学者-A* SERCH ROAD
Platform: | Size: 12288 | Author: sean | Hits:

[matlab] cebk_tsp

Description: 用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 -Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.
Platform: | Size: 3555328 | Author: 陈惠斌 | Hits:

[CSharp] dij--zuiduanlusuanfa

Description: 完整的DIJ最短路法，可以处理全部问题，包括 初学者可以学习的内容-Complete simplex method, we can address all the issues, including the dual simplex type and ordinary simplex
Platform: | Size: 1024 | Author: zhangpeng | Hits:

[Energy industry] Dij

Description: Dijskra算法，可以计算每对点之间的最短距离-Dij algorithmfor calculating the shortest path between two nodes
Platform: | Size: 2048 | Author: eden520 | Hits:
« 12 »

CodeBus www.codebus.net