Bug in digraph table ordering
1 次查看(过去 30 天)
显示 更早的评论
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!
0 个评论
回答(1 个)
Cris LaPierre
2023-8-7
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
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!