Publisher review:Floyd Shortest Path Routing - find the shorest path from any node to any node in a network 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' Requirements: ยท MATLAB Release: R14SP1
Floyd Shortest Path Routing is a Matlab script for Communication Tools scripts design by Weihuang Fu.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Floyd Shortest Path Routing - find the shorest path from any node to any node in a network
Operating system:Windows / Linux / Mac OS / BSD / Solaris