/Python/Highlighting the shortest path in a Networkx graph

Highlighting the shortest path in a Networkx graph

import matplotlib.pyplot as plt
G = nx.karate_club_graph()
pos = nx.spring_layout(G)
nx.draw(G,pos,node_color='k')
# draw path in red
path = nx.shortest_path(G,source=14,target=16)
path_edges = zip(path,path[1:])
nx.draw_networkx_nodes(G,pos,nodelist=path,node_color='r')
nx.draw_networkx_edges(G,pos,edgelist=path_edges,edge_color='r',width=10)
plt.axis('equal')
plt.show()

Source: stackoverflow.com

Similar codes

0 vote132 views1 answer
Auto repost bot instagram python
Python
0 vote138 views1 answer
Increment numper in python
Python
-2 votes146 views2 answers
Savefig matplotlib python
Python
1 vote139 views1 answer
Python sqlite dict
Python
5 votes138 views2 answers
Break all loops
Python
14 votes137 views2 answers
String slice
Python
0 vote146 views1 answer
Python 2nd order ode
Python
0 vote186 views1 answer
Openai gym random action
Python
4 votes151 views2 answers
Python mkdir
Python
1 vote147 views1 answer
Frequency
Python