How to find Dijkstra shortest path for multiple source single destination problem?

I want to find Dijkstra shortest path form three different source nodes to single destination point and my input is netcost matrix.Please help me out to figure out this problem.

Answer 1

[KSSV]

Search in file exchange:

https://in.mathworks.com/matlabcentral/fileexchange/20025-dijkstra-s-minimum-cost-path-algorithm

https://in.mathworks.com/matlabcentral/fileexchange/12850-dijkstra-s-shortest-path-algorithm

https://in.mathworks.com/matlabcentral/fileexchange/14661-dijkstra-very-simple

Answer 2

[Walter Roberson]

%create a graph for illustration
data = randi(15, 20, 2);
G = graph(data(:,1),data(:,2));

sources = [3, 8, 11];
dest = 14;
shortest_paths = shortestpathtree(G, sources, dest, 'outputform', 'cell');

shortest_paths will now be a cell array of paths.