Problem:-
Given a directed Graph , Design an algorithm to find out whether there is a route between nodes.
Code:-
#include<bits/stdc++.h>
using namespace std;
vector<int> arr[100];
// function for checking there is any edges or not
int isedge(int a,int b)
{
for(int child:arr[b])
{
if(child==a)
return 1;
return isedge(a,child);
}
return 0;
}
//Driver program
int main()
{
int n,e;
cout<<"Enter the number of vertex and Edges"<<endl;
cin>>n>>e;
int a,b;
cout<<"Enter the "<<e<<"Edges"<<endl;
for(int i=0;i<n-1;i++)
{
cin>>a>>b;
arr[a].push_back(b);
}
cout<<"Enter the vertexes to check"<<endl;
cin>>a>>b;
if(isedge(b,a))
cout<<"There is an Edge between "<<a<<" and "<<b;
else
cout<<"There is no any Edge between "<<a<<" and "<<b;
return 0;
}
Output:-
Enter the number of vertex and Edges
5 6
Enter the 6 Edges
1 2
3 1
3 5
5 4
2 4
2 3
Enter the vertexes to check
2 4
There is an Edge between 2 and 4
Recommended Post:-
- Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-Data structure:-- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments