图的遍历[DFS][BFS]

#include<iostream>
#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;

int m,n,maxn=0x7fffffff;
int s[][];

bool visit[]={false};
queue<int>str;

void BFS(int );
void DFS(int );

int main()
{
    memset(s,0x7f,sizeof(s));
    cin>>n>>m;
    for(int i=;i<m;++i)
    {
        int x,y,z;
        cin>>x>>y>>z;
        s[x][y]=z;
    }
    memset(visit,false,sizeof(visit));
    cout<<""<<"*****";
    BFS();
    cout<<endl<<"1*****";
    memset(visit,false,sizeof(visit));
    DFS();
}

void BFS(int sum)
{
    cout<<"-->"<<sum;
    visit[sum]=true;
    str.push(sum);
    while(!str.empty())
    {
        int j=str.front();
            str.pop();
        for(int i=;i<=n;++i)
        {
            if(!visit[i]&&s[j][i]!=maxn)
            {
                cout<<"-->"<<i;
                str.push(i);
                visit[i]=true;
            }
        }
    }
}

void DFS(int sum)
{
    int i;
    cout<<"-->"<<sum;
    visit[sum]=true;
    for(int i=;i<=n;++i)
    {
        if(!visit[i]&&s[sum][i]!=maxn)
            DFS(i);
    }
}