Graph breadth-first Traversal

 

// ================================================ =
// Graphic breadth first Traversal
// ================================================ =
# Include <stdlib. h>
# Define MAXQUEUE 10 // maximum capacity of the storage node queue during Traversal
# Define MAX 9
Struct node // graph vertex Structure
{
Int vertex; // vertex Information
Struct node * nextnode; // indicates the next vertex.
};
Typedef struct node * graph; // schema Declaration of the graph
Struct node head [9]; // graph vertex structure array
Int visited [9]; // traverses the record Array

Int queue [MAXQUEUE]; // an array of queues
Int front =-1; // the front end of the queue
Int rear =-1; // the backend of the queue

//----------------------------------------
// Create a graph
//----------------------------------------
Void creategraph (int * node, int num)
{
Graph newnode;