Need Help Friends.

I implemented DFS algorithm to find cycle in a directed graph. Here’s my

```
[1]
The program works fine but my problem is I want to find the entire cycle, i.e. all the nodes present in that cycle. Presently my program only outputs the starting node of a cycle in graph.
Can anyone Kindly guide me on how I can find all the nodes in that cycle.
[1]: https://github.com/Shraeyas/General-Codes/blob/master/cycle.cpp
```