Stack overflow has been a common memory vulnerability for a long time due to limited stack memory. Deep or infinite recursion serves as the main cause to exhaust the stack memory and crash the program. As a relatively new system programming language, Rust suffers from stack overflow problem inevitably. However, there is no relevant tool to detect those stack overflow bugs in Rust programming language. In this paper, we propose a novel approach using fuzz technique to trigger stack overflow bugs in Rust projects. We first build a call graph on Rust MIR (Middle Intermediate Representation). In the call graph, recursions appear as cycles lying in the SCCs (strong connect components). To find the entry APIs of those SCCs, we leverage Tarjan's algorithm to locate the SCCs and then reversely BFS (Breadth First Search) to search for the APIs. After that, we modify the underlying logic of AFL (American Fuzzing Loop) to trigger stack overflow bugs through fuzzing those dangerous APIs. Specifically, we add a function call time counter to accelerate the fuzzing process. We conduct our experiments on several existing Rust CVEs (Common Vulnerabilities and Exposures) related to stack overflow. Experiments show that our approach can trigger stack overflow bugs in a short time.