Shortestpath freeware
Shortestpath
Added: June 08, 2013 | Visits: 335
Given adjacent matrix (transmat) and starting/ending node (pathS, pathE), this function finds the shortest-path (path) that connecting pathS and pathE, and returns the cost (cost):[path, cost]=dijkstra(pathS, pathE, transmat);NOTE: Except for the simple interface, the pathS and pathE can be the...
Platforms: Matlab
License: Freeware | Size: 30.72 KB | Download (43): Dijkstra Algorithm Consistent with Cyclic Paths Download |