BFS 和 DFS 的图形在C++

我一直在尝试对我的图形进行BFS和DFS。我已经尝试了所有方法，但仍然无法弄清楚我的算法出了什么问题。请帮我解决这个问题。

我发送顶点是我的向量，它指向我的图的顶点到 bfs 和 bfs，以便通过它并寻找正确的值。我是新手，在尝试解决它时遇到了很多问题。如果有人可以浏览我的代码并查看我的算法错误之处，那就太好了。我希望一双新鲜的眼睛能够发现这个问题。

它确实显示了输出，但错误！

这是我对图形的输入值：5 1,5 2,5 3,1 4,1 6

3 是 5 的边，依此类推。

这是我得到的输出：对于BFS：5,1,2,3,4,6

对于DFS：5,4,3,2,1,5

这是我的算法：

#ifndef SORT_HPP
#define SORT_HPP
#include <string>
#include <iostream>
#include <fstream>
#include <sstream>
#include <list>
#include <vector>
#include <stack>
#include <algorithm>
#include "clsVertex.hpp"
#include "clsFileGraph.hpp"
#include "clsGraph.hpp";
class bfs : public clsGraph{
    int vert;
public:
    bfs(int s, vector<clsVertex*> verticies); //prints BFS traversal from a given source
};
class dfs: public clsGraph{
    int vert;
    list<int> adj;
public:
    dfs(int s, vector<clsVertex*> verticies);   //prints DFS traversal from a given source
};
bfs::bfs(int s, vector<clsVertex*> verticies){
    bool *visited = new bool[verticies.size()]; //creates a new boolean array of the size of the graph
    for (int i = 0; i < verticies.size(); i++){ //loops till the end of the graph
        int x = verticies[i]->ID;   //gets the value of each vertex
            //cout << "The val: " << verticies[i]->ID << endl;
            visited[x] = false; //marks that vertex as unvisited i.e: visited = false
    }
    list<int> queue;    //creates a queue
    visited[s] = true;  //marks the starting point as visited
    queue.push_back(s); //adds the starting point to the queue
    cout << endl << "The breath first sort is as follows:-" << endl << endl;
    while (queue.size() != 0){  //loops until the size of the queue is 0 
        for (int i = 0; i < verticies.size(); i++){ //loops 
            int y = verticies[i]->edges.size();
            for (int j = 0; j < y; j++){
                int z = verticies[i]->edges[j]->ID;
                if (visited[z]== false){
                    visited[z] = true;
                    queue.push_back(z);
                }
            }
        }
        cout << s << ",";
        queue.pop_front();
        if (queue.size() == 0)
            goto here;
        s = queue.front();
    }
    here:
    cout << ID << " " << graphType << endl;
    for (int i = 0; i < verticies.size(); i++){
        cout << verticies[i]->ID << "->";
        for (int j = 0; j < verticies[i]->edges.size(); j++){
            cout << verticies[i]->edges[j]->ID << endl;
        }
    }
    cout << endl << endl << "Done" << endl << endl;
}


// DFS traversal of the vertices reachable from v. It uses recursive DFSUtil()
dfs::dfs(int s, vector<clsVertex*> verticies)
{
    // Mark all the vertices as not visited
    bool *visited = new bool[verticies.size()]; //creates a new boolean array of the size of the graph
    for (int i = 0; i < verticies.size(); i++){ //loops till the end of the graph
        int x = verticies[i]->ID;   //gets the value of each vertex
        //cout << "The val: " << verticies[i]->ID << endl;
        visited[x] = false; //marks that vertex as unvisited i.e: visited = false
    }
    stack <int> depth;
    visited[s] = true;
    depth.push(s);
    //cout << s << ",";
    while (depth.size() != 0){  //loops until the size of the queue is 0 
        for (int i = 0; i < verticies.size(); i++){ //loops 
            int y = verticies[i]->edges.size();
            for (int j = 0; j < y; j++){
                int z = verticies[i]->edges[j]->ID;
                if (visited[z] == false){
                    visited[z] = true;
                    depth.push(z);
                }
            }
        }
        cout << s << ",";
        depth.pop();
        if (depth.size() == 0)
            goto there;
        s = depth.top();
    }
there:
    cout << "done";
}
#endif