C++遍历图并寻找最短路径

#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<concurrent_priority_queue.h>
#include<functional>
using namespace std;
typedef pair<char,int>P;
struct cmp
{
   
	bool operator ()(const P p1, const P p2)
	{
   
		return p1.second > p2.second;
	}
};

map<char, int>dis={
    {
    'A',1000 },{
    'B',1000 },{
    'C',1000 },{
    'D',1000 },{
    'E',1000 },{
    'F',1000 } };
map<char, char>parent = {
    {
    'A','0' },{
    'B','0' },{
    'C','0' },{
    'D','0' },{
    'E'