paths = cell(number_of_iterations,1);
for K = 1 : number_of_iterations
[dist, paths{K}, pred] = graphshortestpath(DG,7,3);
end
Notice that I used a cell array here rather than a numeric array. Shortest path operations will typically return different lengths of outputs for different graphs.
