
-II-
5.4.2 例题 2:城市间机票价格问题 ......................................................................................................29
5.4.3 bellman_ford_path() 算法例程 ....................................................................................................... 29
5.4.4 程序运行结果 ..................................................................................................................................31
5.5 总结 ............................................................................................................................................................. 31
6 最小生成树问题 ....................................................................................................................................................32
6.1 最小生成树 .................................................................................................................................................32
6.1.1 生成树 ..............................................................................................................................................32
6.1.2 最小生成树和最大生成树 ..............................................................................................................32
6.1.3 最小生成树问题 ..............................................................................................................................33
6.2 最小生成树算法 .........................................................................................................................................33
6.2.1 普里姆算法(Prim 算法) .............................................................................................................33
6.2.2 克鲁斯卡算法(Kruskal 算法) ....................................................................................................34
6.3 NetworkX 的最小生成树算法 ...................................................................................................................34
6.3.1 NetworkX 的最小/最大生成树函数 ...............................................................................................34
6.3.2 minimum_spanning_tree() 使用说明 ..............................................................................................34
6.3.3 案例:天然气管道铺设问题 ..........................................................................................................35
6.4 案例:建设通信网络 .................................................................................................................................37
6.4.1 问题描述 ..........................................................................................................................................37
6.4.2 程序说明 ..........................................................................................................................................37
6.4.3 Python 例程 ......................................................................................................................................38
6.4.4 运行结果 ..........................................................................................................................................39
7 网络流优化问题 ....................................................................................................................................................41
7.1 网络流优化 .................................................................................................................................................41
7.1.1 网络流 ..............................................................................................................................................41
7.1.2 典型的网络流优化问题 ..................................................................................................................42
7.2 网络最大流问题(MFP) .........................................................................................................................42
7.2.1 网络最大流算法 ..............................................................................................................................42
7.2.2 NetworkX 求解网络最大流问题 ....................................................................................................43
7.2.3 maximum_flow() 函数说明 ............................................................................................................ 43
7.2.4 案例:输油管网的最大流量 ..........................................................................................................44
7.2.5 Python 例程 ......................................................................................................................................44
7.2.6 程序运行结果 ..................................................................................................................................47
7.3 最小费用流问题(MCP) ........................................................................................................................ 47
7.3.1 最小费用流问题的算法 ..................................................................................................................47
7.3.2 NetworkX 求解最小费用流问题 ....................................................................................................48
7.3.3 min_cost_flow() 函数说明 ..............................................................................................................48
7.3.4 案例:运输费用 ..............................................................................................................................49
7.3.5 Python 例程 ......................................................................................................................................50
7.3.6 程序运行结果 ..................................................................................................................................53
7.4 最小费用最大流问题(MCMF) .............................................................................................................54
7.4.1 最小费用最大流问题的算法 ..........................................................................................................54
7.4.2 max_flow_min_cost() 函数说明 ..................................................................................................... 54
7.4.3 案例: 输油管网的最大流量和最小费用 ................................................................................... 55
7.4.4 Python 例程 .......................................................................................................................................56
7.4.5 程序运行结果 ..................................................................................................................................57