If a node v is reachable from node u then the path of minimum length u to v is called _____.

Related MCQs

• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
• Number of distinct nodes in any elementary path of length p is ________.
• The problem of finding a path in a graph that visits every vertex exactly once is called?
• If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?
• If the longest chain in a partial order is of length l, then the partial order can be written as            disjoint antichains.
• Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
• Hamiltonian path problem is                    
• Which of the following problems is similar to that of a Hamiltonian path problem?
• Who formulated the first ever algorithm for solving the Hamiltonian path problem?
• In what time can the Hamiltonian path problem can be solved using dynamic programming?