资 源 简 介
在加权的有向图中，可以求出最大流路径，即求出从起点到终点权值之和最大的路径。-In weighted directed graph, we can derive maximum flow path, that is derived from the point of origin to their destination and the largest weight of the path.
文 件 列 表
复件 MaxFlowDemo
res
Graph.cpp
Graph.h
InputDlg.cpp
InputDlg.h
MainFrm.cpp
MainFrm.h
MaxFlowDemo.aps
MaxFlowDemo.clw
MaxFlowDemo.cpp
MaxFlowDemo.dsp
MaxFlowDemo.dsw
MaxFlowDemo.h
MaxFlowDemo.ncb
MaxFlowDemo.opt
MaxFlowDemo.plg
MaxFlowDemo.rc
MaxFlowDemo.reg
MaxFlowDemoDoc.cpp
MaxFlowDemoDoc.h
MaxFlowDemoView.cpp
MaxFlowDemoView.h
MFDControlView.cpp
MFDControlView.h
MFDHintView.cpp
MFDHintView.h
MFDMatrixView.cpp
MFDMatrixView.h
NameDlg.cpp
NameDlg.h
ReadMe.txt
resource.h
Restore.1
MaxFlowDemo.lst
StdAfx.cpp
StdAfx.h
Restore.1
