Remove node and reconnect edges in graph
显示 更早的评论
I have a node in a graph that acts as a sort of 'temporary connector' node. I'd like to remove that node and update the edges in the graph so that all of its immediate predecessors point to its immediate successors.
Example: I have a graph 1 > 2 > 3. I'd like to remove node 2 and end up with the graph 1 > 3.
I read several posts on removing nodes, but couldn't find a way to do what I want.
采纳的回答
s = [1 1 1 1 2 2 3 3 3 5 5];
t = [2 3 4 6 1 5 4 5 6 4 6];
names = string(1:6);
G = digraph(s, t, [], names);
h1 = plot(G);
% Remove node and add the eages
% node 1
G1 = G;
pre = predecessors(G1, 1);
suc = successors(G1, 1);
for i=1:length(pre)
for j=1:length(suc)
G1=addedge(G1, pre(i), suc(j));
end
end
G1 = rmnode(G1, 1); % remove the node 1 also remover the edges to 1
%G.Edges, G1.Edges
figure
h2 = plot(G1);
h2.XData = h1.XData(2:end);
h2.YData = h1.YData(2:end);
7 个评论
IrisL
2022-7-20
Yes. It can be definetely done with the same idea. Instead of finding the predecessors and successors, you need to find the neighbours. Then you need to add edges to each pairs of neighbours of the node to be removed (you may need to check if the edge to be added is already in the original graph).
IrisL
2022-7-20
Chunru
2022-7-20
You may still need two for loops:
for i=1:length(nb) % nb: neighbors
for j=i+1:length(nb)
....
end
end
IrisL
2022-7-21
Chunru
2022-7-21
unique(G.Edges) should work for an Edge Table G.Edges
IrisL
2022-7-21
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Translated by 
