How to Find All Paths in Graph using Depth First Search? | Data Structures

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. This video introduces a new algorithm which is widely used in Graphs - Depth First Search. With this concept, we discuss a question related to this algorithm where we are required to find all paths from the source vertex to the destination vertex using Depth First Search.

#pepcoding #graphs #graphtheoryu

[VijayKumar-bjpe]

Sir, itna depth analysis & dry run aap hi kra skte ho.
Thank you so much jiyo hazaaro saal ❤️🙏

[harshad_dev]

Brilliant level of teaching. Darkhorse of DSA youtube. At the time of this comment, it is 83.3k subs, soon it will be 8.3M subs.

[nknidhi]

When teachers make so much effort, students are bound to learn..!!
Thank you for such quality content..🙏❤️

[farheenahmad]

HATS OFF!! SIR EXPLAINS EVERYTHING WITH SO MUCH OF PATIENCE really helps us to understand the problem very well.

[AmanKumar-kzrn]

sir aap ki jitni bhi video 40, 50, 60 minutes ki hoti hai naa ussme toh alag hi maja aata hai dekhne
question ka what, how, why sab clear 👏

[shlok]

This is one of the best, easy and extremely informative explanation about the concepts of dfs, backtracking and their patterns in general! Amazing work, Sir. Many thanks.

[dhirajshankhwar]

Sir....i can see your hardwork ....and it reallly motivates me to study hard....explaning the core of problem twice or a lot

[nikhilgoyal]

Best video on this problem. Koi bhi itna depth me nhi jaata. Ab clear hua code.

[tusharjajodia]

Ek he toh Dil hai.
Kitne Baar jitoege. PepCoding.

[sathidas]

it is really an awesome session .. I wish i could get this videos before... Thank you sir....

[aniketpandey]

Dry run keval wahi krwa skta hai jisse concept khud acche se aata ho, thanks sir for providing such great content

[nikunjgupta]

Sir I have learn graph from coding ninja course unable to clear all concepts ....but the way you teach and your way of explaining code through dry run is awesome....I suggest your course to everyone

[farheenahmad]

he DRY RUNS the code in DEPTH!!! thanku sumit sir

[kirtikumari]

Sir you are awesome... 🙏🙏no one can beat your explanation

[mickyman]

flood fill itna pyara padaya tha sir ne ki ye bina video dekhe ho gya

[aishwaryadwani]

For those who are getting generic error in java & across the platforms, you can refer the below implementation, its for the same graph shown in the video

int vertices = 7;
ArrayList<ArrayList<Edge>> graph = new ArrayList<>();
for(int i=0;i<vertices;i++) graph.add(new ArrayList<>());

graph.get(0).add(new Edge(0, 1, 10));
graph.get(1).add(new Edge(1, 0, 10));

graph.get(0).add(new Edge(0, 3, 10));
graph.get(3).add(new Edge(3, 0, 10));

graph.get(1).add(new Edge(1, 2, 10));
graph.get(2).add(new Edge(2, 1, 10));

graph.get(2).add(new Edge(2, 3, 10));
graph.get(3).add(new Edge(3, 2, 10));

graph.get(3).add(new Edge(3, 4, 10));
graph.get(4).add(new Edge(4, 3, 10));

graph.get(4).add(new Edge(4, 5, 10));
graph.get(5).add(new Edge(5, 4, 10));

graph.get(5).add(new Edge(5, 6, 10));
graph.get(6).add(new Edge(6, 5, 10));

graph.get(4).add(new Edge(4, 6, 10));
graph.get(6).add(new Edge(6, 4, 10));

[AbhishekGupta-crmf]

Imandar rehna bahut zaruri he --- this line was Awesome ! .. 17:50

[suryanshsingh]

You help me a lot sir.I am very grateful to you

[anandgupta]

Please talk about time complexity as well, great help

[anjneykumarsingh]

What an explanation, salute respect of teacher😊😊💘