Can I preserve adding order when calling graph/addedge?
显示 更早的评论
Hi when calling graph/addedge. The added edge are re-ordered from the adding order. For example:
>> g = graph;
>> g = graph;
>> g = g.addedge(5, 6);
>> g = g.addedge(1, 2);
>> g.Edges
ans =
2×1 table
EndNodes
________
1 2
5 6
Is there a way to avoid this re-order?
This question comes from a requirement that I would like to remember indices of some edges for quick access. However, if calling addedge the indices will be then dis-ordered. It is not suitable to look up edge by EndNodes in my case because the graph can contain multi-edges.
采纳的回答
Christine Tobler
2020-2-24
The edges in a graph are always presented in the same order (sort first by source node, secondarily be target node). You can maintain an index into the previous numbering of the edges by adding a new property that tracks this:
>> g = graph;
>> g = addedge(g, 5, 6, 1);
>> g = addedge(g, 1, 2, 2);
>> g.Edges
ans =
2×2 table
EndNodes Weight
________ ______
1 2 2
5 6 1
3 个评论
Bo
2020-2-24
Christine Tobler
2020-2-25
Hi Bo,
If you keep the graph around without modifying, you could do
edgeOrder(g.Edges.Weight) = 1:numedges(g)
This will give you a direct mapping from the order in which you entered the edges into g, to the index that they have been assigned.
That's O(n) in constructing edgeOrder, and then O(1) in accessing an individual edge.
Bo
2020-2-25
更多回答（0 个）
类别
在 帮助中心 和 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!
Translated by 
