计算机通信网最大流算法的分析和实现

Analysis and Implementation of Maximal-flow Algorithm for Computer Communication Networks

应用网论分析了计算机通信网的最大流，采用ＴＵＲＢＯＣ语言编程实现了基本算法。应用面向对象的程序设计方法，为用户提供交互式图形界面的系统框架。

The maximal-flow for the Compuer Communication Networks is analyzed using network theory.The algorithm selecting a pair of nodes in the given network was implemented by TURBO C programming. By means of object-oriented programming, the system frame worked in the interactive graphical model can be provided and all results of the algorithm can be shown on the display screen intuitively.