Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network.
Chien Tran QuocHung Ho VanPublished in: EAI Endorsed Trans. Ind. Networks Intell. Syst. (2017)
Keyphrases
- shortest path
- weighted graph
- shortest path algorithm
- shortest path problem
- finding the shortest path
- path length
- optimal path
- dynamic programming
- dijkstra algorithm
- edge weights
- minimum spanning tree
- graph structure
- minimum cost flow
- shortest distance
- geodesic distance
- probabilistic model
- network routing
- spanning tree
- optimal solution
- routing algorithm
- flow graph