The Traveling "Tesla" Salesman Problem (TSP) is quite an interesting math problem. It simply asks: Given a list of cities and the distances between them, what is the shortest possible path that visits each city exactly once and returns to the origin city? post 
.
This post assumes a literate programming style while discussing the solution to a classic programming problem with python. Most of the discussion is about setting up the specific input dataset (tesla charging stations) leaving the solution and visualization of result to passing comments.
Wiki aspires to the same generality wielding tools so this might be worth duplicating as a test.
See Polar Dinos for typical scientific journalism.