c++递归实现关于无向图中任意两点的最短距离

#include <string.h>
#include <iostream>
#include <memory.h>
#include <string>
#include <vector>
using namespace std;

bool visited[101];
int min_length = 1000000;
int start;
int enddes;

struct Node
{
int child;
int des;
Node(int a,int b)
{
this -> child = a;
this -> des = b;
}
Node(){}
};

vector<Node> data[101];

void dfs(int node,int length)
{
visited[node] = true;
if(node == enddes - 1)
{
if(length < min_length)
min_length = length;
return;
}

for(int i = 0;i < data[node].size();i++)
{
if(!visited[data[node][i].child])
{
visited[data[node][i].child] = true;
length += data[node][i].des;
dfs(data[node][i].child,length);
length -= data[node][i].des;
visited[data[node][i].child] = false;
}
}
}

int main()
{
int c;
cin >> c;
while(c--)
{

int n;
int st,ed,des;
memset(visited,false,sizeof(visited));
cin >> n;
for(int i = 0;i < n;i++)
{
cin >> st >> ed >> des;
data[st - 1].push_back(Node(ed - 1,des));//因为是无向图，所以两节点互为父子节点
data[ed - 1].push_back(Node(st - 1,des));
}
cin >> start >> enddes;
int length = 0;

dfs(start - 1,length);

for(int i = 0;i < n;i++)
data[i].clear();

cout << min_length << endl;
min_length = 1000000;
}

return 0;

}