Software Listing: Shortest
- Dijkstra Shortest Path Routing
- License: Shareware

This function performs Dijkstra algorithm based on the cost matrix, and shortest path can be found..
- Publisher: Xiaodong Wang
- Date: 07-02-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- A function that finds the shortest path bounded by two curves
- License: Shareware

find the shortest Euclidean path that is bounded by the functions low(t) and high(t). the algorithm is based on Dijkstra shortest path search algorithm syntax: [ty y] = shortest_path_mfile(t,low,high) (See the file shortest_path_example.m - for an example) input: t - input time values. row vector. low(t) - is the lower bound. raw vector. high(t) - is the upper bound. raw vector. output: ty - is a vector of time samples y(ty) - is the shortest path.
- Publisher: yoash levron
- Date: 13-02-2013
- Size: 31 KB
- Platform: Matlab, Scripts
- Implementation of Shortest Route framed in GUI
- License: Shareware

The GUI framed in this m-file will find out the Shortest Route in the network Topologies. First, User have to load the network (Adjacent matrix). Then run the algorithm and fill the information in GUI like Source node, Destination Node and total number of nodes. The results will come on screen (GUI front panel). The results are shortest roue and optimal cost..
- Publisher: Ranjit
- Date: 18-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- dijkstra algorithm
- License: Freeware
- Price: 0.00

it finds the shortest path from the given network having given no of links between given no of nodes and plots the given network as well as the modified network having shortest path in terms of cost.
- Publisher: hardik sanghani
- Date: 11-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- K-Shortest Path
- License: Freeware
- Price: 0.00

This function is based on Yen's k-Shortest Path algorithm (1971) It retuns: 1) [shortestPaths]: the list of K shortest paths (in cell array 1xK) 2) [totalCosts] : costs of the K shortest paths (in array 1xK) Yen's algorithm prevents loops. This function calls a slightly modified/simplified function dijkstra() (submitted by Xiaodong Wang, 2004) The Network/Graph of N nodes is fed in the form of a NXN netCostMatrix which must have positive weights/costs. This file was first submitted on December 9, 2009 This update of April 2, 2010 includes the following slight changes: 1- Handles exception cases for when no path exists, and now returns an empty matrix (added lines 20 and 29) 2- Includes the changes proposed by Darren Rowland.
- Publisher: Meral Shirazipour
- Date: 07-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- A* (A Star) search for path planning tutorial
- License: Freeware
- Price: 0.00

The A* search algorithm is a simple and effective technique that can be used to compute the shortest path to a target location. This tutorial presents a detailed description of the algorithm and an interactive demo..
- Publisher: Paul Premakumar
- Date: 17-01-2013
- Size: 113 KB
- Platform: Matlab, Scripts
- Dijkstra's Shortest Path Algorithm
- License: Shareware

This function can 1. Find the shortest path and distance from a starting node to an ending node on a map** 2. Find the shortest paths and distances from a starting node to ALL other nodes on a map** **The map should consist of nodes and segments, such that: 1. nodes have the format [ID X Y] or [ID X Y Z] (with ID being an integer, and X,Y,Z representing position coordinates and of type double) 2. segments have the format [ID N1 N2] (with ID being an integer, and N1 N2 representing IDs from the nodes list such that there is an [undirected] edge/segment between node N1 and node N2, and obviously of integer type also) Note: The function generates a random map of nodes and segments that it uses if no inputs are given.
- Publisher: Joseph Kirk
- Date: 03-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Travel Guide (Grid Based Djikstra Algorithm)
- License: Shareware

Description of Game: Objective: Shortest Distance Path between 2 Points. Step 1: Define the Map using the GRID Points Only. Step 2: Define the 2 Points to get Shortest Distance Path. Note 1: For every click a Straight Line is drawn to its previous Point. Note 2: "Loop" is used for a different Route definition. Note 3: "Travel" is used to Define 2 Points for a defined Map by user. Note 4: Background Image has no connection with Code (just WallPaper)..
- Publisher: Krishna Lalith
- Date: 05-05-2013
- Size: 102 KB
- Platform: Matlab, Scripts
- Shortest Path with Obstacle Avoidance
- License: Shareware

SHPATH - shortest path with obstacle avoidance (ver 1.3) Given a "terrain" matrix consisting of zeros (for open space) and ones (for obstacles), this function computes the shortest path between two specified points while avoiding obstacles. A two-stage solution is employed. In stage one, the algorithm rapidly propagates through all possible pathways to find a representative shortest route. In stage two, the path is contracted to follow closely around sharp corners and eliminate quantization noise. Although the map coordinates (and intial and final points) are integers, the solution coordinates are reals to allow for the elimination of jitter from map quantization.
- Publisher: Michael Kleder
- Date: 12-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Floyd Shortest Path Routing
- License: Shareware

Given a input adjacent matrix (AdjMax) that represents a weighted, directed graph. The function finds the shorest path from one vertex 'i' to another 'j'. The return values includes a matrix (S) that denotes the shortest distance between vertices 'i' and 'j', and a matrix (P) that denotes the next vertex 'k' on the path from vertex 'i' to vertex 'j'.
- Publisher: Weihuang Fu
- Date: 21-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Shortest distance between two line segments
- License: Shareware

Computes the shortest distance between two line segments given start and end points for each. Adapts the algorithm found on Dan Sunday's website (http://softsurfer.com/Archive/algorithm_01...ment_to_Segment ). Usage: Input the start and end x,y,z coordinates for two line segments. p1, p2 are [x,y,z] coordinates of first line segment and p3,p4 are for second line segment. Output: scalar minimum distance between the two segments. Example: P1 = [0 0 0]; P2 = [1 0 0]; P3 = [0 1 0]; P4 = [1 1 0]; dist = DistBetween2Segment(P1, P2, P3, P4) dist = 1.
- Publisher: Nick Gravish
- Date: 22-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Modified Dijsktra's Algorithm to return all paths that tie for shortest
- License: Shareware

A modification of code published by Jorge Barrera to return all paths that tie for shortest path. This code is heavily based on code published by Jorge Barrera, to the point that I have chosen to include his original documentation along with my own. His original code is linked below. I produced this modification because I found that no implementation of Dijkstra's Algorithm available on Mathworks File Exchange would return multiple paths that tie for shortest. I have debugged this modification using several small networks, and I believe it works, but I have not yet tested it against large networks so I cannot promise that it is entirely bug-free.
- Publisher: David B
- Date: 27-02-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Dijkstra Algortihm with GUI
- License: Shareware

Dijkstra algorithm is used for solving shortest path problem. Dijkstra algorithm is used for solving shortest path problem. This is GUI version. The sample data is saved on *.mat. Usage : >> main.
- Publisher: Dimas Aryo
- Date: 03-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Travel Guide (GridLess Based Djikstra Algorithm)
- License: Shareware

Objective: Shortest Distance Path between 2 Points. Step 1: Define the Map using the GRID Points Only. Step 2: Define the 2 Points to get Shortest Distance Path. Note 1: For every click a Straight Line is drawn to its previous Point. Note 2: "Loop" is used for a different Route Selection definition. Note 3: "Travel" is used to Define 2 Points for a defined Map by user. Note 4: Background Image is just a reference (no connection with Code)..
- Publisher: Krishna Lalith
- Date: 22-06-2013
- Size: 154 KB
- Platform: Matlab, Scripts
- K-Interface
- License: Shareware

K-Interface is an implementation of the simple k-shortest path algorithms. It allows you to define the nodes and edges for your project, the item spacing, the maximum number visible and the maximum degrees of separation between nodes.
Give it a try and see what it can do for you!
.
- Publisher: Hubert Czerpak
- Date:
- Platform: Win7 x64, Windows 7, WinOther, WinVista
- Czech Republic Mileage Chart
- License: Freeware
- Price: 0.00

Czech Republic Mileage Chart consists of a Microsoft Excel 2007 workbook containing four mileage charts giving distance and travel time route lengths for all fastest and shortest routes between the listed cities. Plan your trips to the Czech Republic in detail using Czech Republic Mileage Chart..
- Publisher: mapping-tools.com
- Date:
- Size: 47831 KB
- Platform: Windows 7, WinOther, WinVista
- Shortest way
- License: Freeware
- Price: 0.00

Connect all the dots on the shortest path.
Each road has its price. Choose the cheapest way.
Available 64 levels. From 3 to 16 points.
If the application will be popular in the next version will appear online rating through the levels.
.- Publisher: KIV
- Date: 31-10-2014
- Size: 893 KB
- Platform: Android 2.x, Android 3.x, Android 4.4, Android 4.x
- Teachers Report Assistant
- License: Freeware
- Price: 0.00

Free time saving utility for teachers who word process student reports. Produces professional sounding, individualized report cards in the shortest possible time. The program uses a set of statements written by the teacher or downloaded from the net which can then be tailored to suit individual students. Designed to work in conjunction with your usual word processor. A guaranteed time saver!.
- Publisher: Raylec Software
- Date: 25-09-2003
- Size: 475 KB
- Platform: Win2000, WinOther
- Blockbust
- License: Shareware
- Price: 6.95

The concept is simple. The game is challenging. You collect all the jewels on the screen to proceed to the next level and try to do it in the shortest amount of time. To get to the jewels, you break the colored blocks. If you hit one that is attached to another block of the same color, and it happens to be attached to another of the same color, and so-on, they all break at the same time. However, there are some obstacles. Exploding mines, falling rocks, and in higher levels, objects which appear and disappear and even a night mode. If you are one of the top ten to finish all twenty levels the fastest, you get to put your initials on the board beside your fastest time.
- Publisher: Lanning Software
- Date: 12-04-2005
- Size: 2883 KB
- Platform: Win2000, Windows Server, WinOther
- US Mileage Charts
- License: Shareware
- Price: 20.00

US Mileage Charts and Tables in Excel format, including travel times and distances for both the fastest and shortest routes. Includes sets of tables for every US State, and one large pan-US chart. Total: 204 tables in 51 files. Over half a million distances and times. Data is supplied in a zip of industry-standard Excel formats to allow easy accessibility. Cities are chosen according to population based on US 2000 Census data..
- Publisher: Winwaed Software Technology LLC
- Date: 13-11-2006
- Size: 1267 KB
- Platform: Not Applicable







