已知有向图和图中两个顶点u和v，试编写算法求有向图中从u到v的所有简单路径。

void findpath(ALGraph g, VertexType sv, VertexType tv, StrARR &path, int &i);
void AllPath(ALGraph g, VertexType sv, VertexType tv,
             StrARR &path, int &i)
/* Get all the paths from vertex sv to tv, save them */
/* into Array path which contains string components. */
/* Return the number of path using i                 */
{    
    VertexType temp;
    int j=0, k;
    while(j<5)
    {
        k=6;
        while(path[j][0])
        {
            depath(path[j], path[j][k]);
            k--;
        }
        j++;
    }
    findpath(g, sv, tv, path, i);
}

void findpath(ALGraph g, VertexType sv, VertexType tv, StrARR &path, int &i)
{
    if(sv==tv) {        
        int k=0;
        while(path[4][k]) {
            inpath(path[i], path[4][k]);
            k++;
        }