Make me a Python code

$1.$ Design and visualize a $10-$node toy network $($each path must cost differently$)$ and $($utilizing python networkx$)$

$2.$ After selecting one specific O$/$D pair, apply $4$ algorithms such as Dijkstra, A$*,$ Bellman Ford, and Floyd Warshall, and calculate Shortest path and corresponding distance

$3.$ Visualize Shortest Path on the Network

$4.$ Select two algorithms and present the skim matrix

$($O$/$D pair is at least $10*10)$

$5.$ Compare two skim matrices and present the time it took to derive each skim matrix $($which method takes more time$)$