| 计算机通信网最大流算法的分析和实现 |
| |
| 引用本文： | 沈金龙,喻锦华. 计算机通信网最大流算法的分析和实现[J]. 南京邮电大学学报(自然科学版), 1994, 0(4) |
| |
| 作者姓名： | 沈金龙 喻锦华 |
| |
| 作者单位： | 南京邮电学院计算机系 |
| |
| 摘 要： | 应用网论分析了计算机通信网的最大流，采用ＴＵＲＢＯＣ语言编程实现了基本算法。应用面向对象的程序设计方法，为用户提供交互式图形界面的系统框架，从而可以直观地在显示屏上求得给定网络图任一对节点间的果大流值和流向
|
| 关 键 词： | 计算机通信网，最大流，算法 |
Analysis and Implementation of Maximal-flow Algorithm for Computer Communication Networks |
| |
| Shen Jinlong, Yu Jinhua. Analysis and Implementation of Maximal-flow Algorithm for Computer Communication Networks[J]. JJournal of Nanjing University of Posts and Telecommunications, 1994, 0(4) |
| |
| Authors: | Shen Jinlong Yu Jinhua |
| |
| Abstract: | 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. |
| |
| Keywords: | computer communication network maximal-flow algorithm |
| 本文献已被 CNKI 等数据库收录！ |
