bfs.rar_bfs_visual c

/* * * Algo LABBFS: breadth first search implementation * Created by pirabarlen cheenaramen on 16/03/09. * */ #include <iostream> #include <limits> #include <queue> //#include <stdio> //#include <ctype> using namespace std; struct node /*vertex*/ { char value; struct node *next; }; node *fillNodes(node nodes[]) // error: expected initializer before '*' token ???? { char input='A'; int buf=65; node *newNode; node *currentNode; printf("\nEnter all vertices that exists in your graph, terminate input with 0 :\n"); for(int i=0; i<26; i++) { nodes[i].value=0; nodes[i].next=NULL; } while(buf!=0 && buf>=65) { cin>>input; if(input>0) input=toupper(input); buf=int(input); //printf("\n%i",buf); if(buf!=0 && buf>=65) { nodes[buf-65].value=input; } } printf("\nNow fill in relations [edges]:"); for(int j=0; j<26; j++) { //printf("\ntest%c", nodes[j].value); if(nodes[j].value!=0) { printf("\nInsert all vertex linked to %c, terminate with 0\n", nodes[j].value); buf=65; input='A'; while(buf!=0 && buf>=65) { //printf("\nValue input in int=%i in char=%c @ %c ", input, input, nodes[j].value); cin>>input; //printf("\nValue inputin int =%i in char=%c @ %c ", input, input, nodes[j].value); if(input>0) input=toupper(input); buf=int(input); //printf("\nValue buf=%i @ %c ", buf, nodes[j].value); if(buf!=0 && buf>=65) { input=char(buf); input=toupper(input); currentNode=&nodes[j]; while(currentNode->next!=NULL) { currentNode=currentNode->next; } currentNode->next=new node; currentNode=currentNode->next; currentNode->value=input; currentNode->next=NULL; } } } } return nodes; } void visit(node nodes[]) { std::queue< int >theQueue; theQueue.push(nodes[0].value-65); node *currentNode; int realValue; int visited[26]; for(int i=0; i<26; i++) visited[i]=-1; while( !theQueue.empty() ) { realValue=theQueue.front(); if(visited[realValue]==-1) printf(" %c", realValue+65); theQueue.pop(); currentNode=&nodes[realValue]; visited[realValue]=1; //printf(" %c ", realValue+65); while(currentNode->next!=NULL) { currentNode=currentNode->next; if(visited[(int(currentNode->value)-65)]==-1) //if not visited { theQueue.push( int(currentNode->value)-65 ); } } } printf("\n"); } int main() { node *nodes; nodes=new node[26]; nodes=fillNodes(nodes); //'fillNodes' was not declared in this scope visit(nodes); return 0; }