Update readme.md

[ranisnehal]

Related Issue

• Info about Issue or bug fixes #[issue number that will be closed through this PR]

Describe the changes you've made

A clear and concise description of what you have done to successfully close your assigned issue. Any new files? or anything you feel to let us know!

Language Used:

[Mention the Language of Code]

Checklist:

• [x] I have placed my code file in the (/Code) Folder e.g. If it's a Code in JAVA then I have placed my code pr_name.java file in (/Code/Java/) Directory.
• [x] I have Added the Description, Approach, and Working of Code at the beginning of Code.
• [x] I have added 2 or more Testcases at the Bottom side of the Code.
• [x] I have Added Time and Space Complexity at the End of the Code.
• [x] I have Explained the Variables use in Complexity e.g. O(n) where n is the length of an array.
• [x] I have Updated the Readme Related to the Topics e.g., if the issue is regarding Matrix then Update the Readme.MD present in 2D_Array Folder.
• [x] I have added Proper Comments in between the Code for Better Explanation.
• [x] I have sorted the list of the Readme.MD where I have added the issue in the Alphabetical Order.

[github-actions[bot]]

AlgoTree team will review your PR soon. Take Care of Few of the Things where most contributors are missing out. @ranisnehal :)

[ranisnehal]

/ Here is the solution of the program in c++/

include<bits/stdc++.h>

include

using namespace std;

class solution{ public:

bool solve(int src , vector<int> &vis, vector<int> &order,vector<int> adj[]){
    vis[src]= 1;
    order[src]= 1;
    for(auto x:adj[src])
    {
      if(!vis[x])
       {   
         bool conf = solve(x,vis,order,adj);
         if(conf == true)
         return true;
        }
     else if(order[x])
      return true;
    }
    order[src] = 0;
    return false;
}

bool iscyclic(int v,vector adj[]) { vector vis(v,0); vector order(v,0); for(int i=0;i<v;i++) { if(!vis[i]) { bool c = solve(i,vis,order,adj); if(c==true); return true; } } return false; } };

time complexity:- O(v)

[ranisnehal]

fixed issue #2056 and #2059 using c++

[ranisnehal]

#

[ranisnehal]

@ranisnehal