Download All

No BSD License

3.6

3.6 | 5 ratings Rate this file 21 Downloads (last 30 days) File Size: 1.12 KB File ID: #11549

Floyd Shortest Path Routing

27 Jun 2006 (Updated 27 Jun 2006)

find the shortest path from any node to any node in a network

File Information
Description	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'
MATLAB release	MATLAB 7.0.1 (R14SP1)

Tags for This File
Everyone's Tags	floyd(2), function(2), graph, input, matrix, shortest path routing(2)
Tags I've Applied
Add New Tags	Please login to tag files.

Comments and Ratings (7)
28 Jun 2006	J. Magro	It might take hours or even days to compute the shortest path for a large adjacency matrix using this un-vectorized code. Too many loops!
16 Nov 2006	Hamid Smith
16 May 2007	J. Kimer
05 Nov 2007	Tom Shan	worked for me
29 Sep 2009	Benjamin Knight	Great code works perfectly for my problem which was a small matrix (47x47) and didn't have much node connection redundancy. I had lots of issues with the dijkstra algorithms which kept returning 'inf' results - although I suspect connection redundancy was the issue here.
29 Sep 2009	Benjamin Knight	Great code works perfectly for my problem which was a small matrix (47x47).
31 Dec 2009	yousaf zia	Great work.......help me to solve my problem.... i have to find the shortest path from source to destination by considering minimum loss of packets,delay ,bandwidth utilization and weight into account........just hint me what to do by GA.. have u known link related to my work. thanking you

Please login to add a comment or rating.