in Algorithms
84 views
0 votes
0 votes
Consider the minimum weight on a directed graph where, instead of edges vertices have weights. The weight of the path is sum of the weight of vertices excluding end points. The input is a graph with n vertices and m edges, Weigths Wv for every vertex v and starting vertex s. Can this problem can be solved using Dijkstra's algorithms by converting weighted vertices to weighted edges? What will be the time complexity?
in Algorithms
84 views

Please log in or register to answer this question.

Related questions