Breadth first traversal of graphs stored in adjacency matrix

From , 3 Years ago, written in C, viewed 227 times.

void BFSTraverseAL ( MGraph *G )
{/*广度优先遍历以邻接矩阵存储的图G*/
        int i;
        for ( i=0; i<G->n; i++ )
                visited[i]=FALSE; /*标志向量初始化*/
        for ( i=0; i<G->n; i++ )
                if ( !visited[i] ) BFSM ( G,i ); /* vi 未访问过，从vi 开始BFS 搜索*/
}/*BFSTraverseAL*/

Reply to "Breadth first traversal of graphs stored in adjacency matrix"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Breadth first traversal of graphs stored in adjacency matrix

Reply to "Breadth first traversal of graphs stored in adjacency matrix"