Finding the Shortest Path in a Directed Graph
Create and view a directed graph with 6 nodes and 11 edges.
W = [.41 .99 .51 .32 .15 .45 .38 .32 .36 .29 .21];
DG = sparse([6 1 2 2 3 4 4 5 5 6 1],[2 6 3 5 4 1 6 3 4 3 5],W);
h = view(biograph(DG,[],'ShowWeights','on'));
Salve, come mai dopo aver preso il seguente codice su mathworks eseguendolo mi da errore?