1.

In a directed acyclic graph with a source vertex s, the quality-score of a directed path is defined to be the product of the weights of the edges on the path. Further, for a vertex v other than s, the quality-score of v is defined to be the maximum among the quality-scores of all the paths from s to v. The quality-score of s is assumed to be 1.The sum of the quality-scores of all vertices on the graph shown above is _______ .(A) 929(B) 81(C) 729(D) 1023

Answer» None


Discussion

No Comment Found

Related InterviewSolutions