How to plot a path in special order in an complete graph?
2 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
Marlon Ulbort
il 26 Giu 2021
Commentato: Marlon Ulbort
il 26 Giu 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 Commenti
Risposta accettata
Chunru
il 26 Giu 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
Più risposte (0)
Vedere anche
Categorie
Scopri di più su Graph and Network Algorithms in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!