edited by
319 views

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
adityaaswal asked Nov 30, 2018
512 views
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)
2 votes
2 votes
1 answer
2
0 votes
0 votes
0 answers
4
Shamim Ahmed asked Nov 26, 2018
380 views
Which of the following procedure is suitable to find longest path from given vertex to any other vertex in Directed Acyclic Graph?Answer: Dynamic Programming.Why Greedy A...