I am trying to code a variant of Dijkstra's shortest path algorithm. In doing that, I want to initialize the shortest path distances to math.inf, and have this
So I am scrapping multiple rows of a table and many of them are either available or not for different pages. What I want to do is to detect which field is not a