如何使用dfs O（n）打印图形的MaxPath？

Question

We want to find the farthest vertex to the i-th vertex,

farthest vertex to the current vertex of graph, gives the maximum Path to us.

Please help me to get this right:

vector<int> v[100];
bool mark[100];
int v1;

inline int max_path(int k)
{
    int result = -1;
    mark[k] = true;
    for(int i=0; i<v[k].size(); i++)
        if(!mark[v[k][i]])
        {
            int x = max_path(v[k][i]);
            if(x > result)
            {
                result = x;
                v1 = v[k][i];
            }
        }
    return result+1;
}

v1 must be the farthest vertex to the current vertex (k), and result must be the length of the path.

Answer 1

您可以使用int result[n] ，然后打印该int result[n]的最大变量。