Finding the length of the longest directed cycle in a directed graph

The purpose of this project was to be able to find the longest possible connected cycle in a directed graph. This allowed me to use my graph traversal knowledge to find the longest possible cycle in the graph from a given starting node.

Through this project, I learned why it is important to know where the longest or shortest path in a graph is and how to find this best.

This project did not give me any future inspiration.