I am trying to optimize the distance from node 0 in this exercise. I could not figure out how to automate the whole process where Python would read the data and print the shortest path from node 0 to 7. The only trick is the calculation has to start from node 0. I used min() to get the minimum distance from node 0 but from there I can not figure out how to proceed. Any help would be much appreciated! Thank you. enter image description here
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…