数据结构：邻接矩阵

DJ斯特拉算法 ![Pasted image 20250806160248](../../../../_assets/f6b3bac-Pasted image 20250806160248.png) ![Pasted image 20250806161832](../../../../_assets/7771850-Pasted image 20250806161832.png) ![Pasted image 20250806162101](../../../../_assets/b578e57-Pasted image 20250806162101.png)

网络最大流量图

![Pasted image 20250806163619](../../../../_assets/b7c196c-Pasted image 20250806163619.png) ![Pasted image 20250806163711](../../../../_assets/6e45b20-Pasted image 20250806163711.png) ![Pasted image 20250806163821](../../../../_assets/c4d1bd4-Pasted image 20250806163821.png) ![Pasted image 20250806164150](../../../../_assets/84e76a1-Pasted image 20250806164150.png)

![Pasted image 20250806164852](../../../../_assets/59b4801-Pasted image 20250806164852.png)

最小费用最大流