"Normally", these instructions should be also valid (in similar way) for other Linux distros.
1.- Install Xdebug using pacman:
sudo pacman -Sy xdebug| function D = dijkstra(G, pairs) | |
| % This function takes an adjacency matrix called G | |
| % and a p-by-2 matrix called pairs. | |
| % The pairs matrix will contain pairs of indices. | |
| % This function will determine the shortest distance from | |
| % the first index in the pair to the second index for | |
| % every pair in matrix pairs. | |
| % | |
| % The function will only return a p-by-1 matrix of shortest | |
| % distances. I could use it to also return the shortest path, |