Hello everyone, I recently started the concept of Graph theory and covered breadth-first search, depth-first search, breadth-first traversal, and depth-first traversal in theory only, but I want to solve problems out there and don’t know where to get the proper editorials for those…like creating a graph using the user inputs and searching for the required nodes.
There is a problem where I’m stuck in and that is, given N numbers(1, 2, …N), the connections between the nodes are given as pairs and two special nodes are provided such as say 3 and 6(the special nodes are always directly connected)…we need to find all the nodes that are common to both the special nodes or somehow connected to both the special nodes.
For example, let’s consider a case where N = 10 and the special nodes are 4 and 5.
The connections between the nodes are given below,
We need to find the solution nodes that are common and print it as follows,
1 2 3 6 7
Someone help me with this.
Take a look at the implementation for BFS in my GitHub repository. It is well commented. I will be adding one for DFS soon.
Edit: Can you also provide the problem link?
Thank you so much brother…this really helped a lot.
I have also uploaded the implementation of DFS.
I’m having a confusion here…will this work on multiple test cases as because the algorithm has a global vector array adjacency list i.e.
vector<int> AdjList[N]; if we move further from one test case to another then the elements of the previous test cases are there and that might affect the output of the ongoing test…isn’t it @arujbansal1.
Can you have a look at that?
Yaa…that worked, actually I was trying to pop out the elements one by one…my bad …Thanks @everule1
If you wanna practice questions related to graph you can practice it on codemonk
If you have multiple test cases and you want simplicity, just declare the Adjacency List inside your test case loop. You won’t have to call AdjList[I].clear(). You can pass this list into the function as an argument instead. You can do it any way you prefer.
I did that earlier but it was showing runtime error…clearing the adjacency list at last worked.