返回最低节点的名称

首先，这是大学课程的一部分，所以虽然复制粘贴解决方案可以，但我正在寻找更多的深度。反正我明天会见我的主管。

现在进入问题。我正在为 5 个链接节点 A-E 实现 Dijkstra 算法，这些节点的相关成本和链接存储在一个向量中;

struct Node
{
char nodeLink;  //adjacent link
int cost;       //cost of a link
};                  //to use in Dijkstra algorithm

class HeadNode
{
public:
char Name;
bool Visited;
vector<Node> nodes;
HeadNode(char x) { Name = x; Visited = false; }
};
class Graph
{
char Start = 'A';
char StartNode;
char CurrentNode;
char Destination = 'E';
int TotalCost = 0;
vector<HeadNode> hnode;
vector<char> path;
vector<int> weight;
public:
Graph();
void createHeadNode(char X);
void createAdjMatrix();
char LeastDistance(char node);
void printAdjMatrix();
void Dijkstra(char StartNode);
char GetStartNode();
};

int main()
{   
Graph graph;
graph.createHeadNode('A');
graph.createHeadNode('B');
graph.createHeadNode('C');
graph.createHeadNode('D');
graph.createHeadNode('E');
graph.createAdjMatrix();
//graph.printAdjMatrix();
graph.Dijkstra(graph.GetStartNode());
system("pause");
return 0;
}
Graph::Graph()
{
}

void Graph::createHeadNode(char x)
{
hnode.push_back(x);
}

为了正确实现算法，我在类图中创建了一个前体函数 MinimumDistance((。我还有一个获取开始节点的函数，但这在这里不是特别重要;

char Graph::LeastDistance(char node)
{
int smallest = 9999;
char smallestNode;
for (int i = 0; i < hnode.size(); i++)
{
for (int j = 0; j < hnode[i].nodes.size(); ++j)
{
if ((node == hnode[i].Name) && (hnode[i].nodes[j].cost <= smallest) && (hnode[i].Visited == false))
{
smallest = hnode[i].nodes[j].cost;
smallestNode = hnode[i].nodes[j].nodeLink;
}
else
{
hnode[i].Visited = true;
break;
}
}
}
TotalCost = TotalCost + smallest;
return(smallestNode);
}
void Graph::Dijkstra(char StartNode)
{
CurrentNode = StartNode;
if (CurrentNode == Destination)
{
cout << "the start is the destination, therefore the cost will be 0." << endl;
}
else
{
while(true)
{
if (CurrentNode != Destination)
{
CurrentNode = LeastDistance(StartNode);
cout << CurrentNode << "<-";
}
else if (CurrentNode == Destination)
{
cout << endl;
cout << "The total cost of this path is:" << TotalCost;
TotalCost = 0;//reset cost
break;
}
}
}
}

我的问题是 MinimumDistance 功能似乎总是返回节点 C，导致它被一遍又一遍地打印，所以它填满了控制台。到目前为止，我已经尝试使用Visual Studio 2017进行调试，但是我对手表没有多大意义。我还调整了中断的顺序，并试图确保访问的标志设置为 true。我不确定是否有任何操作的优先级会影响这一点。

提前谢谢。