/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 vote189 views1 answer
Matplotlig adding progress bar
Python
0 vote205 views1 answer
Aggregate the elements of each partition, and then the results for all the partitions
Python
-1 vote214 views1 answer
How to create templates in python
Python
0 vote295 views1 answer
Tkinter attribute error
Python
4 votes208 views2 answers
Godot string format
Python
1 vote224 views2 answers
Deleting in a text file in python
Python
6 votes191 views1 answer
How to simulate a key press in python
Python
0 vote218 views1 answer
F = open("yourfile.txt", "r") TypeError: an integer is required (got type str)
Python
2 votes192 views2 answers
Coding the fibonacci sequence
Python
61 votes267 views6 answers
Python pause
Python