Question

For the sixth question of this assignment, you must design and implement a function that takes a Graph as its first argument and a Node as its second argument and has a list of Nodes (i.e., a [Node] as its return value). The return value must be the list of Nodes traversed by a breadth-first search traversal of the Graph argument, starting from the Node argument, in the order in which they appear during the traversal. When your breadth-first search algorithm has a "choice" of which Node to explore, it must process the nodes in numerical order. As a clarifying example, please note that the breadth first search traversal of the Graph included as the previous example starting from Node 1 should be [1, 3, 4, 2]

(Programming in Haskell)

Answer 1

#include "main.h"
int distinctWord(string fileName)
{
   fstream f(fileName.c_str());
   map< string,set<int> > dict;
   if(f==NULL)
   {
       cout<<"file doest opened"<<endl;
       exit(1);
   }
   string word;
   string line;
   int lineNo=0;
   map< string,set<int> >::iterator itr;
   set<int>::iterator i;
   while(getline(f,line))
   {   lineNo++;       //for counting of current line no
       stringstream iss(line);
       while(iss >> word)
       {  
       dict[word].insert(lineNo);   //storing word as key and set as value which store line in which word present
       }
   }
   for( itr=dict.begin();itr!=dict.end();itr++)
   {
       cout<<"word: "<<itr->first<<endl<<"lines: ";
       //printing the set values
       for(i= (itr->second).begin();i!=(itr->second).end();i++)
           cout<<*i<<" ";
       cout<<endl;
   }
   return 0;
}

int main(){
   string s;
   cout<<"enter the file location: ";
   cin>>s;
  
   distinctWord(s);
   return 0;
  
}