I recently started learning graph theory and I completed the traversal algorithms. I am having difficulties in implementing the code which are applications of the traversal. So can anyone share their implementation of basic graph questions like

1. Check whether an undirected graph is acyclic if not print the cycle.
2. How to get all paths from a source vertex to a destination in a Directed graph.

Thanks!