大佬们，这道小明传信息的游戏的题目，用递归怎么解决

int getSolutionCount(int n, int relation[][2] , int relationSize, int k, int no)
{
    int count = 0;
    if (k > 0)
    {
        for (int i = 0; i < relationSize; ++i)
        {
            if (relation[i][0] == no)
            {
                int nextNo = relation[i][1];
                if (nextNo == n - 1 && k == 1)
                {
                    count++;
                }
                else
                {
                    count += getSolutionCount(n, relation, relationSize, k - 1, nextNo);
                }
            }
        }
    }
    return count;
}