Computer Sciences > GATE 2021 SET-2 > Graph Theory
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 the vertices in the graph shown above is _______.
Correct : 929 to 929
Similar Questions
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______.
Total Unique Visitors
Loading......