Question: Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?
Options
A : BFS
B : DFS
C : Binary search
D : Radix sort
Discrete Mathematics Objective more questions
Crossing over doesn’t take place ________________
The transition zone for Raman spectra is __________
_____________ is used to apply whitewash.
Where is the localizer antenna placed?
Which of the following is formed as a by product....
Choose the incorrect statement about DFS and BFS from the....
What is the air gap flux density for PMDC motor?
The magnetic energy of a magnetic material is given by
In India, where are the radioactive badges sent for monitoring?
Which of the below is an example for earth dam?
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Discrete Mathematics Modular Exponentiation
Discrete Mathematics Multiple Choice
Discrete Mathematics Multiplication Theorem Probability
Discrete Mathematics Nested Quantifiers
Discrete Mathematics Number Relations
Discrete Mathematics Online Quiz
Discrete Mathematics Online Test
Discrete Mathematics Partial Orderings