清空筛选条件
清空筛选条件

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

2 次查看（过去 30 天）
Marlon Ulbort
Marlon Ulbort 2021-6-26
评论： Marlon Ulbort 2021-6-26
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?

请先登录，再回答此问题。

采纳的回答

Chunru
Chunru 2021-6-26
Ran in:
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

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

产品


版本

R2019b

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by