GATE CS 2022: Algorithm 2 (App update required to attempt this test)
Attempt now to get your rank among 218 students!
Which of the following is not a depth first search traversal of the given graph?
The average number of bits/char is require to send-
S1 : A graph where all edge weights are distinct can have more than one shortest paths between two vertices.
S2 : Adding a number on every edge of a graph may change the shortest path between two vertices.
T(n)= T(n/2) + n else
The number of comparison for last element inserted is _________.
- 218 attempts
- 2 upvotes
- 0 comments