| 关于网络最大流问题的生长树求法 |
| |
| 引用本文： | 何永生,李连魁. 关于网络最大流问题的生长树求法[J]. 高师理科学刊, 1995, 0(2) |
| |
| 作者姓名： | 何永生 李连魁 |
| |
| 作者单位： | 齐齐哈尔铁路工程学校(何永生)，农业银行齐齐哈尔干部学校(李连魁) |
| |
| 摘 要： | 本文对网络中最大流问题的求法进行了探索.利用画树图,给出了网络最大流的生长树求法.
|
| 关 键 词： | 网络 最大流 生长树 |
On the Growth Tree Evaluation of Netwerk Maximal Flow |
| |
| He Yongsheng. On the Growth Tree Evaluation of Netwerk Maximal Flow[J]. Journal of Science of Teachers＇College and University, 1995, 0(2) |
| |
| Authors: | He Yongsheng |
| |
| Affiliation: | He Yongsheng(Qiqihar Railway Engineering School)Li Liankui(Qiqihar Agriculture Bank Cadre School) |
| |
| Abstract: | The research is made in this article on evaluation of maximal flow in network,giving the growth tree evaluation on maximal flow of network by drawing the tree map. |
| |
| Keywords: | Notwork Maximal flow Growth tree |
| 本文献已被 CNKI 等数据库收录！ |
