What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
|B.||o(n! * n)|
|Answer» B. o(n! * n)|
|Explanation: for a graph having n vertices traverse the permutations in n! iterations and it traverses the permutations to see if adjacent vertices are connected or not takes n iterations (i.e.) o(n! * n).|
Login to Continue
It will take less than 2 minutes