摘要
本文应用图论方面的知识，总结了几种求解最小费用的算法。给出了带有赋边权和顶点权的城市交通网络最小费用问题的求解过程。
In this paper,we use the knowledge of graphic theory, then generalize the general minimum expense algorithms.We also give the minimum expense solution about the city communicating network with node weight and edge weight.
出处
《电脑知识与技术》
2006年第7期152-152,179,共2页
Computer Knowledge and Technology
关键词
最小费用算法
交通网络
顶点权
minimum cost algorithms
communicating network
node weight
