Bug in digraph table ordering

Hello all,

This is not a question but rather a bug report. Suppose you create a digraph by means of a node table and an edge table, if you later want to order the network node table by means of sortrows command, indexing becomes inconsistent. Lost half a day trying to understand what was going on. I believe sortrows command is locked out from edge table precisely for this reason, but no lock prevents sortrows from operating on node tables. Be aware!

Example code:

di_network = digraph(edge_table, nodetable);

edge_table = sortrows(edge_table, 'Surnames') % this command returns a mistake

node_table = sortrows(node_table, 'Surnames') % this command DOES NO return a mistake, but it generates inconsitent results

The inconsist result I witness is that search indexes fail to retreive known objects in the edge_table after ordering the node_table.

thanks!

Answer 1

[Cris LaPierre]

This is a community forum. If you want to report a potential bug, you can do so here: https://www.mathworks.com/support/contact_us.html

[Andrea]

I thought it could be of help for others puzzled by the behaviour. I will report the bug as well