DFS, BFS and traversal search of Graphs

 1)DFS The basic way of writing ：

/**
 * \1) DFS The basic way of writing , It can be used as a template 
 */

/**
DFS(int index,int nowK,int sum)
{
    if( Meet the conditions )
        return;
    if(nowK,sum The value of is impossible if the conditions are met )
        return;
    if(judge(index))
    {
         Some constraints can be added here , This node has been accessed , Set this node as accessed ;
        DFS(index+1);
         You can go back here ;
    }
}
*/

2) BFS The basic way of writing

/**
   2) BFS The basic way of writing 
*/

/**
BFS(int index)
{
    queue<int> q;
    q.push(index);
    inq[index]=true;  // Here we need to pay attention to ,inq Is whether the node is in the team , Not whether to visit , Otherwise, it will cause 
    while(!q.empty())   // Multiple same nodes join the team , This is related to DFS Of vis Functions are different ;
    {
        int top=q.front();
        q.pop();
        for(...)
        {
             take top The elements of the next node of the join the queue ;
             Set the queued element to queued ;
        }
    }
}
*/

3) Depth first traversal search of graph (DFS)

/**
    3) Depth first traversal search of graph (DFS)
*/

/**
 Adjacency matrix version ：
int G[maxv][maxv],maxn;
bool vis[maxv];

void DFS(index) //index Label the currently accessed vertex 
{
    vis[index]=true;    // take index Set to visited 
    for(int i=0;i<maxn;++i) // Interview and index Unicom's point 
    {
        if(G[index][i]!=INF&&vis[i]!=true)
            DFS(i);
    }
}

void DFSTrave()
{
    for(int i=0;i<maxn;++i)
        if(vis[i]==false)
            DFS(i);
}
*/

/**
 Adjacent tables ：
int maxn,maxv;
vector<int> adj[maxv];
bool vis[maxv];

void DFS(index) //index Label the currently accessed vertex 
{
    vis[index]=true;    // take index Set to visited 
    for(int i=0;i<adj[index].size();++i)
    {
        int v=adj[index][i];    // Note here is the acquisition yes adj[index] In the value of the 
        if(vis[v]==false)
            DFS(v);
    }
}

void DFSTrave()
{
    for(int i=0;i<maxn;++i)
        if(vis[i]==false)
            DFS(i);
}
*/

4) Breadth first search algorithm for Graphs

/**
   4)  Breadth first search algorithm for Graphs 
*/

/**
 Adjacency matrix version ：
int G[maxv][maxv],maxn;
bool inq[maxv];

void BFS(index) // Traverse index The connecting block 
{
    queue<int> q;
    q.push(index);
    inq[index]=true;
    while(!q.empty())
    {
        int top=q.front();
        q.pop();
        for(int i=0;i<maxn;++i)
        {
            if(G[index][i]!=INF&&inq[i]==false)
            {
                q.push(i);
                inq[i]=true;
            }
        }
    }
}

void DFSTrave() // Ergodic graph G
{
    for(int i=0;i<maxn;++i)
        if(inq[i]==false)
            DFS(i);
}
*/


/**
 Adjacent tables ：
int maxn,maxv;
vector<int> adj[maxv];
bool inq[maxv];

void BFS(index) // Traverse index The connecting block 
{
    queue<int> q;
    q.push(index);
    inq[index]=true;
    while(!q.empty())
    {
        int top=q.front();
        q.pop();
        for(int i=0;i<adj[index].size();++i)
        {
            int v=adj[index][i];        // Note here is the acquisition yes adj[index] In the value of the 
            if(inq[v]==false)
            {
                q.push(v);
                inq[v]=true;
            }
        }
    }
}

void DFSTrave() // Ergodic graph G
{
    for(int i=0;i<maxn;++i)
        if(vis[i]==false)
            DFS(i);
}
*/