1. You are given a graph and a src vertex. 2. You are required to find and print all hamiltonian paths and cycles starting from src. The cycles must end with "*" and paths with a "." Note -> A hamiltonian path is such which visits all vertices without visiting any twice. A hamiltonian path becomes a cycle if there is an edge between first and last vertex. Note -> Print in lexicographically increasing order.
Input Format
Input has been managed for you
Output Format
Check sample output
Constraints
None
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
7 9 0 1 10 1 2 10 2 3 10 0 3 10 3 4 10 4 5 10 5 6 10 4 6 10 2 5 10 0
Output
0123456. 0123465. 0125643* 0346521*