HNUST-OJ-1806-图的遍历——广度优先搜索

代码实现 

#include
using namespace std;
#define MAX 100
typedef int VerTexType,qelemtype;
typedef int Arctype,status;
typedef struct
{
    VerTexType vexs[MAX];
    Arctype arcs[MAX][MAX];
    int vexnum,arcnum;


} graph;
VerTexType vertexdata(const graph &g,int i)
{
    return g.vexs[i];
}
int firstadjves(const graph &g,int v)
{
    for(int j=0; j>g.vexnum;
    for(int i=0; i>g.arcs[i][j];

    }


}
bool vis[MAX];
queueq;
void bfs(graph &g,int v)
{
    cout<=0; w=nextadjves(g,u,w))
        {

            if(!vis[w])
            {
                cout<