DSA - Level 1 - How to Find Path in Graphs using Depth First Search | Graphs in Data Structures

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the question where we are required to check if a graph has a path from the source vertex to the destination vertex or not. We discuss the constructor of a graph using an Edge class and how a graph is present in memory. We solve this question using recursion - Faith and Expectation ,a similar technique which was used while solving the flood fill question in recursion. To watch the solution for Flood Fill, click here: https://youtu.be/R1URUB6_y2k For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation #pepcoding #graphs #datastructures Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education