Question: Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?
Options
A : add all values by 10
B : subtract 10 from all the values
C : multiply all values by 10
D : in both the cases of multiplying and adding by 10
Data Structure Directed Graph more questions
_________________ disguises them as legitimate software & appear as Java....
_____________ track the user’s online activities like search queries, history....
Which of the following are the registers that are used....
Which of the following is an 8-bit command in MC68HC11?
The best way to compare the different implementations of symbol....
What can be done for the fine grain protection of....
Which of the following is not a physical security measure....
Which round provides linear diffusion in the Whirlpool Algorithm?
Which one of these is not a Whirlpool function?
What is the correct order of operation within each round....
Data Structure Adjacency List more Online Exam Quiz
Data Structure Counting Boolean Parenthesizations
Data Structure Depth First Search
Data Structure Dice Throw Problem
Data Structure Direct Addressing Tables
Data Structure Directed Acyclic Graph
Data Structure Double Ended Queue
Data Structure Doubly Linked Lists