NetworkX 有权无向图计算最短路径时函数shortest_path(G[, source, target, weight,…])和函数dijkstra_path(G, source, target[, weight])有什么区别？
参考链接：https://blog.csdn.net/youcans/article/details/116999881?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522167210396716800213045638%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=167210396716800213045638&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-116999881-null-null.142^v68^control,201^v4^add_ask,213^v2^t3_control1&utm_term=networkx%20shortest_path&spm=1018.2226.3001.4187
