從圖中刪除邊

Question

我用權重做了一個圖表。 我正在嘗試刪除 Node1 的權重。 我刪除了 Node1，但它的權重仍然存在。 我怎樣才能刪除重量呢？ 我的代碼：

import networkx as nx
import matplotlib.pyplot as plt
G=nx.DiGraph()
i=1

#Adding nodes to graph
# "pos" is for the location of the nodes
G.add_node(0,pos=(0,5))
G.add_node(1,pos=(10,0))
G.add_node(2,pos=(5,-5))
G.add_node(3,pos=(-5,-5))
G.add_node(4,pos=(-10,0))

# Adding edges each node
G.add_edge(0,4,weight=2)
G.add_edge(0,1,weight=5)
G.add_edge(0,2,weight=3)


G.add_edge(1,3,weight=6)
G.add_edge(1,2,weight=2)

G.add_edge(2,1,weight=1)
G.add_edge(2,3,weight=2)

G.add_edge(4,3,weight=4)
G.add_edge(4,2,weight=10)
G.add_edge(4,1,weight=6)

pos=nx.get_node_attributes(G,'pos')
list = [nx.dijkstra_path(G,4,1,6),nx.dijkstra_path(G,4,2,10),nx.dijkstra_path(G,4,3,4)]
print((list))
print("Shortest path btwn 4-1:",nx.dijkstra_path(G,4,1),"=",nx.dijkstra_path_length(G,4,1))
print("Shortest path btwn 4-2:",nx.dijkstra_path(G,4,2),"=",nx.dijkstra_path_length(G,4,2))
print("Shortest path btwn 4-3:",nx.dijkstra_path(G,4,3),"=",nx.dijkstra_path_length(G,4,3))

labels = nx.get_edge_attributes(G,'weight', )
print("Before removing Node 1: ",G.nodes)

nx.draw_networkx_edge_labels(G,pos,edge_labels=labels, )
nx.draw(G, pos, with_labels=True)

plt.show()
plt.clf() #Clears the current figure.

G.remove_node(1) # this line of code remove only vertex, don't forget also remove weights

print("*****************")
print("******************")
print("After removing Node1: ",G.nodes)
nx.draw_networkx_edge_labels(G,pos,edge_labels=labels, )
nx.draw(G, pos, with_labels=True)
plt.show()

我刪除Node1之前的圖：

刪除Node1后我的圖：

Answer 1

繪制邊緣權重的原因是刪除節點后權重沒有更新。 因此，刪除節點后應重新計算腳本中的pos和labels ：

G.remove_node(1) # this line of code remove only vertex, don't forget also remove weights
labels = nx.get_edge_attributes(G,'weight', )
pos=nx.get_node_attributes(G,'pos')

這是完整的例子：

import networkx as nx
import matplotlib.pyplot as plt
G=nx.DiGraph()
i=1

#Adding nodes to graph
# "pos" is for the location of the nodes
G.add_node(0,pos=(0,5))
G.add_node(1,pos=(10,0))
G.add_node(2,pos=(5,-5))
G.add_node(3,pos=(-5,-5))
G.add_node(4,pos=(-10,0))

# Adding edges each node
G.add_edge(0,4,weight=2)
G.add_edge(0,1,weight=5)
G.add_edge(0,2,weight=3)


G.add_edge(1,3,weight=6)
G.add_edge(1,2,weight=2)

G.add_edge(2,1,weight=1)
G.add_edge(2,3,weight=2)

G.add_edge(4,3,weight=4)
G.add_edge(4,2,weight=10)
G.add_edge(4,1,weight=6)

pos=nx.get_node_attributes(G,'pos')
list = [nx.dijkstra_path(G,4,1,6),nx.dijkstra_path(G,4,2,10),nx.dijkstra_path(G,4,3,4)]
print((list))
print("Shortest path btwn 4-1:",nx.dijkstra_path(G,4,1),"=",nx.dijkstra_path_length(G,4,1))
print("Shortest path btwn 4-2:",nx.dijkstra_path(G,4,2),"=",nx.dijkstra_path_length(G,4,2))
print("Shortest path btwn 4-3:",nx.dijkstra_path(G,4,3),"=",nx.dijkstra_path_length(G,4,3))

labels = nx.get_edge_attributes(G,'weight', )
print("Before removing Node 1: ",G.nodes)

nx.draw_networkx_edge_labels(G,pos,edge_labels=labels, )
nx.draw(G, pos, with_labels=True)

plt.show()
plt.clf() #Clears the current figure.

G.remove_node(1) # this line of code remove only vertex, don't forget also remove weights
labels = nx.get_edge_attributes(G,'weight', )
pos=nx.get_node_attributes(G,'pos')

print("*****************")
print("******************")
print("After removing Node1: ",G.nodes)
nx.draw_networkx_edge_labels(G,pos,edge_labels=labels, )
nx.draw(G, pos, with_labels=True)
plt.show()