## Check if directed graph is connected

Problem Given a directed graph, check if it is connected or not. Sample Input Sample Output YES Explanation Start from 0, go to 1, and then 2, hence all the nodes of the graph are connected. Approach We will use the Depth First Search algorithm to solve this problem. We will traverse the given graph and keep marking… Read More »