Based on the definition of class shortest path in weighted rough graph,class shortest path algorithm in weighted rough graph is presented,which extends classica
On the basis of capacity flow model,a new model is developed for a load-sharing k-out-of-n:G system consisting of different components,to describe the increase