Dijkstra algorithm consistent with cyclic paths in matlab

The following Matlab project contains the source code and Matlab examples used for dijkstra algorithm consistent with cyclic paths. 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 same node, i.

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

Project Files: 

File NameSize
cases.fig 2459
cases.fig.bak 2863
cases.png 3799
dijkstra.m 1701
dijkstra.m.html 4580
dijkstra.m~ 1616
dijkstra_stub1.m 1153
dijkstra_stub1.m.html 3729
dijkstra_stub2.m 729
dijkstra_stub2.m.html 2598
graph.dot 209
graph.eps 8169
graph.png 3523
randgraph.png 10712
README.html 2412