How to plot a path in special order in an complete graph?
2 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Marlon Ulbort
le 26 Juin 2021
Commenté : Marlon Ulbort
le 26 Juin 2021
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?
0 commentaires
Réponse acceptée
Chunru
le 26 Juin 2021
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
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Graph and Network Algorithms dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!