computes shortest paths in a graph by using weights on edges-08228
__________ computes shortest paths in a graph by using weights on edges as a measure of distance.
This multiple choice question (MCQ) is related to the book/course
vu cs610 Computer Network.
It can also be found in
vu cs610 Final Term - Quiz No.3.
__________ computes shortest paths in a graph by using weights on edges as a measure of distance.
Greedy algorithm
Distance vector algorithm
Dijksta's algorithm
Non of the given
