摘要
本文讨论一类新的赋权图 ,称为双权图 ,G=( V,E;w,c) ,w称为权函数 ,c为容量函数 .并给出了 G中两顶点 u与 v之间具有最大能量的最短路的算法 .
This paper studied the biweighted graph with a new weighted graph and denoted by G=(V,E;w,c). The function w and c is the weight function of G and capacity function of G , respectively. We gives an algorithm for solving the shortest path of maximum capacity connecting two specified vertices u and v .
出处
《工科数学》
2000年第2期63-65,共3页
Journal of Mathematics For Technology
