# How to find a longest cycle and a longest induced cycle in a graph?

Sage has `longest_path`

. Do we have a command to find a longest cycle for a given graph? And an induced cycle is a cycle that is an induced subgraph of $G$; induced cycles are also called chordless cycles. Then do we have a function to find the longest induced cycle?