Location:
Search - SHORTEST-PATHS
Search list
Description: 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the shortest paths and shortest path graph of the function. This is a peer-to-peer (S-T) Dijkstra algorithm improvements. Seeking 2:00 for all the shortest path.
Platform: |
Size: 3133 |
Author: 阎一 |
Hits:
Description: 旅行商算法算出全国31外城市的最短单源路径。-traveling salesman algorithm calculates the country's 31 cities outside the single source shortest paths.
Platform: |
Size: 1889 |
Author: qw |
Hits:
Description: k Shortest Paths
David Eppstein s method
ICTCLAS研究学习组
http://groups.google.com/group/ictclas?msg=subscribe-k Shortest Paths David Eppstein's method IC TCLAS Studies Group http : / / groups.google.com / group / sub ictclas msg = scribe
Platform: |
Size: 19942 |
Author: Jian Ye |
Hits:
Description: Floyd-Warshall算法描述
1)适用范围：
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法结束：dis即为所有点对的最短路径矩阵
3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。
考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
Platform: |
Size: 3567 |
Author: 江晨 |
Hits:
Description: 走迷宫 Find a path through the maze to any space character in the perimeter of the maze. Paths through the maze are denoted by a space character and walls by any other non white-space character (apart from . characters). -Maze Find a path through the maze to any space character in the perimeter of the maze. Paths through the maze are denoted by a space character and walls by any other non white-space character (apart from. Characters).
Platform: |
Size: 2048 |
Author: 张欢 |
Hits:
Description: c#+arcengine实现最短路径分析-c#+ arcengine realize the shortest path analysis
Platform: |
Size: 2693120 |
Author: ilikegreentea |
Hits:
Description: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。
开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。
-OSPF is a routing protocol. Routing algorithm and routing protocol in the concept is different. Network hosts, routers, routing algorithm, through the formation of routing table to determine the sending packet transmission path. The routing protocol is a router used to create routing tables and update the routing information of the communication protocol. Open Shortest Path First protocol (Open Shortest Path First, OSPF) is the most important one of the internal gateway protocol. Through the curriculum design, students can establish a routing table and routing information updates such as more intuitive and clear understanding.
Platform: |
Size: 1024 |
Author: 猪八戒 |
Hits:
Description: 用c#写的最短路径算法，需要的可以参考一下-With c# Write the shortest path algorithm, needed for reference
Platform: |
Size: 100352 |
Author: jiadunxin |
Hits:
Description: Dijkstra算法与Floyd算法的matlab实现，以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem
Platform: |
Size: 2048 |
Author: 姚益武 |
Hits:
Description: arcengine最短路径分析用CSharp代码编写的-arcengine shortest path analysis prepared CSharp code
Platform: |
Size: 3072 |
Author: 车风 |
Hits:
Description: ACM测试数据，题目甜牛奶，练习单源点最短路径的好题。-ACM test data, the subject of sweet milk, practicing single-source shortest path a good title.
Platform: |
Size: 27648 |
Author: ly |
Hits:
Description: K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。-K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic.
Platform: |
Size: 49152 |
Author: wei |
Hits:
Description: 这是对A*寻路算法的一个封装.使用非常简单:1.指定寻路区域的大小(网格) 2.指定哪些节点是障碍物 3.给定出发节点点和目标节点, 寻路! 将返回最短路径. 另外, 还可以设定遇到障碍物时只能绕着障碍物的角走-This is a routing algorithm A* a package. The use of very simple: 1. Specified routing region size (grid) 2. Specify which node is the barrier 3. Given the starting point and the goal node node, routing ! will return the shortest path. In addition, obstacles encountered can be set only when the angle go around obstructions
Platform: |
Size: 3072 |
Author: youarehaha |
Hits:
Description: This will calculate the shortest path of a Graph
Platform: |
Size: 67584 |
Author: chaminda |
Hits:
Description: Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
Platform: |
Size: 2048 |
Author: jazz |
Hits:
Description: arcgis+C#组件 写的 实现 最短路径分析-arcgis+ C# component to write to achieve the shortest path analysis
Platform: |
Size: 83968 |
Author: 赵辉 |
Hits:
Description: this a program to count the shortest path in a graph-this is a program to count the shortest path in a graph
Platform: |
Size: 387072 |
Author: nitadewi |
Hits:
Description: A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node and some vertex v (i.e. a cycle), we can delete the last edge of the longer path without increasing the distance from the root node to any node in the subgraph.
If every pair of nodes in the graph has a unique shortest path between them, then the shortest path tree is unique. This is because if a particular path from the root to some vertex is minimal, then any part of that path (from node u to node v) is a minimal path between these two nodes.
In graphs with no negative distances, Dijkstra s algorithm computes the shortest path tree, from a given vertex. In graphs with possibly negative distances, the Bellman-Ford algorithm can be used instead.
Platform: |
Size: 7168 |
Author: darulor |
Hits:
Description: 计算机算法基础中，求最短路径算法的源代码，C语言编写！-Computer algorithm based on the source code, find the shortest path algorithm, C language!
Platform: |
Size: 745472 |
Author: chenj |
Hits:
Description: 参考《Multiple Object Tracker Using K-Shortest Paths》实现的代码，使用K最短路径实现多目标追踪功能。-Reference " Multiple Object Tracker Using K-Shortest Paths" to achieve code, use the shortest path K multi-target tracking capabilities.
Platform: |
Size: 3415040 |
Author: 黄凯 |
Hits: