write a c++ program to print all possible paths from source to destination in an undirected unweighted graph.

Question

any suggestions how to do it?

Answer 1

You can do it using DFS.
1) Go DFS
2) Memorize current path
3) If destination reached, print current path
Implementation: https://code.sololearn.com/cuaiawSn7vIj/#cpp

Answer 2

sorry bro I'm a beginner. i didn't understand the program. can u plz write it without using vectors.

Answer 3

yes bro.

Answer 4

please do it using arrays

Answer 5

Everything else is clear? (I mean except vectors). If yes, i can write it using arrays.

Answer 6

Here it is
https://code.sololearn.com/c536nqyLrTyf/#cpp