Fill in the order form to get the price

Subject

Category

Deadline

Timezone:

Title *

Task *

{"ops":[{"insert":"Complete the function \u2018find_path_dfs()\u2019 which finds cost of going from the source vertex (src) to destination vertex (dst) using Depth First Search (DFS) algorithm. Use stack for implementing DFS algorithm.\n\nvoid find_path_dfs(int * graph, int size, int src, int dst)\n{\n\u00a0\u00a0int visited[size] ={0};\n\u00a0\u00a0struct node * top =NULL; \/\/Make a stack for holding the visited vertices\n\u00a0\u00a0int crnt_visiting =src;\n\u00a0\u00a0int crnt_exploring =src;\n\u00a0\u00a0int path_cost =0;\n\u00a0\u00a0bool PATH_FOUND =false;\n\u00a0\u00a0while(!PATH_FOUND)\n\u00a0\u00a0{\n\u00a0\u00a0\u00a0\u00a0visited[crnt_visiting] =1;\n\u00a0\u00a0\u00a0\u00a0struct element temp;\n\u00a0\u00a0\u00a0\u00a0if(crnt_visiting==dst)\t\/\/If the vertex is found\n\u00a0\u00a0\u00a0{\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0printf(\"\\nPath found: \");\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0printf(\"\\nCost: %d\\n\", path_cost);\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0while(!isStackEmpty(&top))\n\u00a0\u00a0\u00a0\u00a0\u00a0{\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0printf(\"Pop\\n\");\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0pop(&top);\n\u00a0\u00a0\u00a0\u00a0\u00a0}\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0PATH_FOUND=true;\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0continue;\n\u00a0\u00a0\u00a0}\n\u00a0\u00a0\u00a0\u00a0else\u00a0\u00a0\/\/Explore this vertex\n\u00a0\u00a0\u00a0\u00a0{  \/\/Complete this function. You are free to make any changes to this function. Make sure that path cost is correctly found.\n\u00a0\u00a0\u00a0\u00a0}}}\n\n"}]}

I need basic explanations

Special Requirements

Upload files (if required)

Drop files here to upload

Add files...

Account info

Already have an account?

Name *

E-mail *

Password *

The password must be at least 6 characters.

I agree with terms & conditions