How to plot a path in special order in an complete graph?

Dear Community,

For example, given ist a prah G with 29 nodes and 406 edges. An optimal solution of the travelings Salesman Problem is given in a vector a including every node in special order, plus the first node again to complete the cycle. So vector a consists 30 but 29 entries.

A=triu(magic(29));%adjacency matrix
G=graph(A);
a=[1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 1];

Is there an easy way to plot the tour, highlight the tour just by feeding a?

Answer 1

[Chunru]

A=triu(magic(6));       % adjacency matrix
G=digraph(A);           % for digraph 
h=plot(G);              % plot graph
a = [1:6 1];            % tour
highlight(h, a, 'EdgeColor', 'g');  % Note that 6->1 is not a path

[Marlon Ulbort]

Upsi, thats an easy answer... embarrassing i didnt tried it before...

Thanks alot! Great help :--)