利用深度优先遍历的思想从指定节点出发，寻找长度为M的所有简单路径(Using the idea of depth first traversal, starting from the specified nodes, we look for all simple paths of length M.)