MATLAB: Graphshortestpath function visiting all nodes

graphgraph theorygraphshortestpathpath

Hi,

Is there a way I can manipulate this function in order to force the path include all nodes? I mean, how can I change the code in order to include each node to find the shortest path , but with the constrain that we must visit all nodes?

Thank you in advance

Best Answer

Any feedback on my last q staff?

https://www.mathworks.com/matlabcentral/answers/386714-graphshortestpath-function-visiting-all-nodes#comment_545301

Related Solutions

MATLAB: How to understand “predecessor node” of the winning paths

The PRED in your example 'encodes' all shortest paths from S to all other nodes, for example the shortest path between 1 and 6 is PRED(6) = 4, PRED(4) = 5, PRED(5) = 1 and PRED(1) = 0, therefore the path is (in reverser order) 1-5-4-6. But with the same output you could figure out the minimum path between 1 and 3: i.e. PRED(3) = 5, PRED(5) = 1 and PRED(1) = 0, giving the path 1-5-3.

MATLAB: Path between 2 nodes in a graph

One way to proceed would be to use concomp.

Take this example graph

s = [1 2 2 3 3 3 4 5 5 5 8 8];
t = [2 3 4 1 4 5 5 3 6 7 9 10];
G = graph(s,t);
plot(G,'Layout','layered')

>> components=conncomp(G)
ans =
     1     1     1     1     1     1     1     2     2     2

We can see that there are two connected components. To see it nodes 4 and 7 are connected (for example), just see if they are members of the same component.

components(4)==components(7)
ans =
  logical
   1

Best Answer

Related Solutions

MATLAB: How to understand “predecessor node” of the winning paths

MATLAB: Path between 2 nodes in a graph

Related Question