fork download

copy

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
 
#define MAX 5
 
struct Vertex {
   char label;
   bool visited;
};
 
//queue variables
 
int queue[MAX];
int rear = -1;
int front = 0;
int queueItemCount = 0;
 
//graph variables
 
//array of vertices
struct Vertex* lstVertices[MAX];
 
//adjacency matrix
int adjMatrix[MAX][MAX];
 
//vertex count
int vertexCount = 0;
 
//queue functions
 
void insert(int data) {
   queue[++rear] = data;
   queueItemCount++;
}
 
int removeData() {
   queueItemCount--;
   return queue[front++]; 
}
 
bool isQueueEmpty() {
   return queueItemCount == 0;
}
 
//graph functions
 
//add vertex to the vertex list
void addVertex(char label) {
   struct Vertex* vertex = (struct Vertex*) malloc(sizeof(struct Vertex));
   vertex->label = label;  
   vertex->visited = false;     
   lstVertices[vertexCount++] = vertex;
}
 
//add edge to edge array
void addEdge(int start,int end) {
   adjMatrix[start][end] = 1;
   adjMatrix[end][start] = 1;
}
 
//display the vertex
void displayVertex(int vertexIndex) {
   printf("%c ",lstVertices[vertexIndex]->label);
}       
 
//get the adjacent unvisited vertex
int getAdjUnvisitedVertex(int vertexIndex) {
   int i;
 
   for(i = 0; i<vertexCount; i++) {
      if(adjMatrix[vertexIndex][i] == 1 && lstVertices[i]->visited == false)
         return i;
   }
 
   return -1;
}
 
void breadthFirstSearch() {
   int i;
 
   //mark first node as visited
   lstVertices[0]->visited = true;
 
   //display the vertex
   displayVertex(0);   
 
   //insert vertex index in queue
   insert(0);
   int unvisitedVertex;
 
   while(!isQueueEmpty()) {
      //get the unvisited vertex of vertex which is at front of the queue
      int tempVertex = removeData();   
 
      //no adjacent vertex found
      while((unvisitedVertex = getAdjUnvisitedVertex(tempVertex)) != -1) {    
         lstVertices[unvisitedVertex]->visited = true;
         displayVertex(unvisitedVertex);
         insert(unvisitedVertex);               
      }
 
   }   
 
   //queue is empty, search is complete, reset the visited flag        
   for(i = 0;i<vertexCount;i++) {
      lstVertices[i]->visited = false;
   }    
}
 
int main() {
   int i, j;
 
   for(i = 0; i<MAX; i++) // set adjacency {
      for(j = 0; j<MAX; j++) // matrix to 0
         adjMatrix[i][j] = 0;
   }
 
   addVertex('S');   // 0
   addVertex('A');   // 1
   addVertex('B');   // 2
   addVertex('C');   // 3
   addVertex('D');   // 4
 
   addEdge(0, 1);    // S - A
   addEdge(0, 2);    // S - B
   addEdge(0, 3);    // S - C
   addEdge(1, 4);    // A - D
   addEdge(2, 4);    // B - D
   addEdge(3, 4);    // C - D
 
   printf("\nBreadth First Search: ");
 
   breadthFirstSearch();
 
   return 0;
}

Main.java:1: error: illegal character: '#'
#include <stdio.h>
^
Main.java:1: error: class, interface, or enum expected
#include <stdio.h>
         ^
Main.java:2: error: illegal character: '#'
#include <stdlib.h>
^
Main.java:3: error: illegal character: '#'
#include <stdbool.h>
^
Main.java:5: error: illegal character: '#'
#define MAX 5
^
Main.java:9: error: class, interface, or enum expected
   bool visited;
   ^
Main.java:10: error: class, interface, or enum expected
};
^
Main.java:14: error: class, interface, or enum expected
int queue[MAX];
^
Main.java:15: error: class, interface, or enum expected
int rear = -1;
^
Main.java:16: error: class, interface, or enum expected
int front = 0;
^
Main.java:17: error: class, interface, or enum expected
int queueItemCount = 0;
^
Main.java:22: error: class, interface, or enum expected
struct Vertex* lstVertices[MAX];
^
Main.java:25: error: class, interface, or enum expected
int adjMatrix[MAX][MAX];
^
Main.java:28: error: class, interface, or enum expected
int vertexCount = 0;
^
Main.java:32: error: class, interface, or enum expected
void insert(int data) {
^
Main.java:34: error: class, interface, or enum expected
   queueItemCount++;
   ^
Main.java:35: error: class, interface, or enum expected
}
^
Main.java:39: error: class, interface, or enum expected
   return queue[front++]; 
   ^
Main.java:40: error: class, interface, or enum expected
}
^
Main.java:44: error: class, interface, or enum expected
}
^
Main.java:51: error: class, interface, or enum expected
   vertex->label = label;  
   ^
Main.java:52: error: class, interface, or enum expected
   vertex->visited = false;     
   ^
Main.java:53: error: class, interface, or enum expected
   lstVertices[vertexCount++] = vertex;
   ^
Main.java:54: error: class, interface, or enum expected
}
^
Main.java:59: error: class, interface, or enum expected
   adjMatrix[end][start] = 1;
   ^
Main.java:60: error: class, interface, or enum expected
}
^
Main.java:65: error: class, interface, or enum expected
}       
^
Main.java:71: error: class, interface, or enum expected
   for(i = 0; i<vertexCount; i++) {
   ^
Main.java:71: error: class, interface, or enum expected
   for(i = 0; i<vertexCount; i++) {
              ^
Main.java:71: error: class, interface, or enum expected
   for(i = 0; i<vertexCount; i++) {
                             ^
Main.java:74: error: class, interface, or enum expected
   }
   ^
Main.java:77: error: class, interface, or enum expected
}
^
Main.java:83: error: class, interface, or enum expected
   lstVertices[0]->visited = true;
   ^
Main.java:86: error: class, interface, or enum expected
   displayVertex(0);   
   ^
Main.java:89: error: class, interface, or enum expected
   insert(0);
   ^
Main.java:90: error: class, interface, or enum expected
   int unvisitedVertex;
   ^
Main.java:92: error: class, interface, or enum expected
   while(!isQueueEmpty()) {
   ^
Main.java:97: error: class, interface, or enum expected
      while((unvisitedVertex = getAdjUnvisitedVertex(tempVertex)) != -1) {    
      ^
Main.java:99: error: class, interface, or enum expected
         displayVertex(unvisitedVertex);
         ^
Main.java:100: error: class, interface, or enum expected
         insert(unvisitedVertex);               
         ^
Main.java:101: error: class, interface, or enum expected
      }
      ^
Main.java:106: error: class, interface, or enum expected
   for(i = 0;i<vertexCount;i++) {
             ^
Main.java:106: error: class, interface, or enum expected
   for(i = 0;i<vertexCount;i++) {
                           ^
Main.java:108: error: class, interface, or enum expected
   }    
   ^
Main.java:114: error: class, interface, or enum expected
   for(i = 0; i<MAX; i++) // set adjacency {
   ^
Main.java:114: error: class, interface, or enum expected
   for(i = 0; i<MAX; i++) // set adjacency {
              ^
Main.java:114: error: class, interface, or enum expected
   for(i = 0; i<MAX; i++) // set adjacency {
                     ^
Main.java:115: error: class, interface, or enum expected
      for(j = 0; j<MAX; j++) // matrix to 0
                 ^
Main.java:115: error: class, interface, or enum expected
      for(j = 0; j<MAX; j++) // matrix to 0
                        ^
Main.java:117: error: class, interface, or enum expected
   }
   ^
Main.java:120: error: class, interface, or enum expected
   addVertex('A');   // 1
   ^
Main.java:121: error: class, interface, or enum expected
   addVertex('B');   // 2
   ^
Main.java:122: error: class, interface, or enum expected
   addVertex('C');   // 3
   ^
Main.java:123: error: class, interface, or enum expected
   addVertex('D');   // 4
   ^
Main.java:125: error: class, interface, or enum expected
   addEdge(0, 1);    // S - A
   ^
Main.java:126: error: class, interface, or enum expected
   addEdge(0, 2);    // S - B
   ^
Main.java:127: error: class, interface, or enum expected
   addEdge(0, 3);    // S - C
   ^
Main.java:128: error: class, interface, or enum expected
   addEdge(1, 4);    // A - D
   ^
Main.java:129: error: class, interface, or enum expected
   addEdge(2, 4);    // B - D
   ^
Main.java:130: error: class, interface, or enum expected
   addEdge(3, 4);    // C - D
   ^
Main.java:132: error: class, interface, or enum expected
   printf("\nBreadth First Search: ");
   ^
Main.java:134: error: class, interface, or enum expected
   breadthFirstSearch();
   ^
Main.java:136: error: class, interface, or enum expected
   return 0;
   ^
Main.java:137: error: class, interface, or enum expected
}
^
64 errors

Standard output is empty