Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linearmulticomodity multicost network

EAI Endorsed Transactions on Industrial Networks and Intelligent Systems

Hung Ho Van¹  Chien Tran Quoc² 

[1] Quang Nam University;University of Da Nang;

关键词: graph;    network;    multicommodity multicost flow;    optimization;    linear programming.;   

DOI  :  10.4108/eai.21-12-2017.153499

来源: DOAJ

【 摘 要 】

The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph. Next, the algorithm finds the shortest path between the pairs of vertices on the extended graph with multiple weights is developed. Then, the shortest path finding algorithms is used to find the maximum flow on the multicommodity multicost extended network is developed in the article[12].

【 授权许可】

Unknown