<p>I\'ve got the following code. The program is supposed to read the input file
ID: 3650675 • Letter: #
Question
<p>I've got the following code. The program is supposed to read the input file entered by the user. But everytime I try to enter the path of the input file, I keep getting the following error, "Enable To Open Input.txt File. Program Is Terminating Now...."</p><p><br></p><p>Here's the content of the input file.</p><p><br></p><p><p>5 1 </p><p>0 1 3 -1 -1 </p><p>1 0 3 6 -1 </p><p>3 3 0 4 2 </p><p>-1 6 4 0 5 </p><p>-1 -1 2 5 0 </p><div><br></div></p><p>The program is supposed to read the datas from the input file and print out the output. </p><p>Can anyone please correct this code where the program will indeed read the input file and won't give me the error. Thanks everybody.</p><p><br></p><p>Here's the code: </p><p><br></p><p><p>#include<iostream></p><p>#include<fstream></p><p>#include<cstdlib></p><p>#include<string></p><p>#include <iomainp></p><p><br></p><p>#define MAX 10</p><p>using namespace std;</p><p>class prims</p><p>{</p><p><span class="Apple-tab-span"> </span>private : int cost[MAX][MAX], tree[MAX][MAX];</p><p><span class="Apple-tab-span"> </span> int n;</p><p><span class="Apple-tab-span"> </span>public : int readmatrix();</p><p><span class="Apple-tab-span"> </span> int spanningtree(int);</p><p><span class="Apple-tab-span"> </span> void display(int);</p><p><span class="Apple-tab-span"> </span> void init();</p><p>};</p><p><br></p><p>void prims :: init()</p><p>{</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>for( int i = 1; i <= n ; i++ )</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>for( int j = 1; j <= n; j++ )</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>tree[i][j] = -1;</p><p><span class="Apple-tab-span"> </span>if( i == j )</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>tree[i][j] = 0;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}</p><p>}</p><p><br></p><p>int prims :: readmatrix()</p><p>{</p><p><span class="Apple-tab-span"> </span>ifstream textfile;</p><p><span class="Apple-tab-span"> </span>int source;</p><p><span class="Apple-tab-span"> </span>cout<<"Enter The File Name : ";</p><p><span class="Apple-tab-span"> </span>cin>>filename;</p><p><span class="Apple-tab-span"> </span>string filename;</p><p><span class="Apple-tab-span"> </span>ifstream textfile;</p><p><br></p><p><span class="Apple-tab-span"> </span>textfile.open(filename.c_str());</p><p><span class="Apple-tab-span"> </span>if(textfile.is_open())</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cout<<" Open Input.txt File For Reading."<<endl;</p><p><span class="Apple-tab-span"> </span>cout<<" Reading Data From Input.txt File.........."<<endl;</p><p><span class="Apple-tab-span"> </span>cout<<" Reading Number Of Vertices From File"<<endl;</p><p><span class="Apple-tab-span"> </span> textfile>>n;<span class="Apple-tab-span"> </span>// Reading Number Of Vertices In The Graph</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>cout<<"Number Of Vertices In The Tree Is : "<<n<<endl;</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>cout<<" Reading The Source Vertice From File"<<endl;</p><p><span class="Apple-tab-span"> </span>textfile>>source;</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>while(!textfile.eof())</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>for(int i=1;i<=n;i++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>for(int j=1;j<=n;j++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>textfile>>cost[i][j];</p><p><span class="Apple-tab-span"> </span>if( i == j)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cost[i][j] = -1;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>if(cost[i][j]== -1)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cost[i][j]=999;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>cout<<"Process Of Reading Is Now Complete."<<endl;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>else</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cout<<"Enable To Open Input.txt File";</p><p><span class="Apple-tab-span"> </span>cout<<"Program Is Terminating Now......";</p><p><span class="Apple-tab-span"> </span>exit(1);</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>cout<<"Closing File Input.txt........."<<endl;</p><p><span class="Apple-tab-span"> </span>textfile.close();</p><p><span class="Apple-tab-span"> </span>system("pause");</p><p><span class="Apple-tab-span"> </span>return source;</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>/*int i = 0;</p><p><span class="Apple-tab-span"> </span>int j = 0;</p><p><span class="Apple-tab-span"> </span>cout << " Enter the number of vertices in the Graph : ";</p><p><span class="Apple-tab-span"> </span>cin >> n;</p><p><span class="Apple-tab-span"> </span>cout << " Enter the Cost matrix of the Graph ";</p><p><span class="Apple-tab-span"> </span>for (i = 1; i <= n; i++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>for (j = 1; j <= n; j++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cin >> cost[i][j];</p><p><span class="Apple-tab-span"> </span>if( i == j)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cost[i][j] = -1;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>if(cost[i][j]== -1)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cost[i][j]=999;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}*/</p><p>}</p><p><br></p><p>int prims :: spanningtree(int src)</p><p>{</p><p><span class="Apple-tab-span"> </span>int visited[MAX], d[MAX], parent[MAX];</p><p><span class="Apple-tab-span"> </span>int i, j, k, min, u, v, stcost;</p><p><span class="Apple-tab-span"> </span>for (i = 1; i <= n; i++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>d[i] = cost[src][i];</p><p><span class="Apple-tab-span"> </span>visited[i] = 0;</p><p><span class="Apple-tab-span"> </span>parent[i] = src;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>visited[src] = 1;</p><p><span class="Apple-tab-span"> </span>stcost = 0;</p><p><span class="Apple-tab-span"> </span>k = 1; </p><p><br></p><p><span class="Apple-tab-span"> </span>for (i = 1; i < n; i++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>min=999;</p><p><span class="Apple-tab-span"> </span></p><p><span class="Apple-tab-span"> </span>for (j = 1; j <= n; j++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>if (!visited[j] && d[j] < min)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>min = d[j];</p><p><span class="Apple-tab-span"> </span>u = j;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>visited[u] = 1;</p><p><span class="Apple-tab-span"> </span>stcost = stcost + d[u];</p><p><span class="Apple-tab-span"> </span>//tree[k][1] = parent[u];</p><p><span class="Apple-tab-span"> </span>tree[parent[u]][u] = d[u];</p><p><span class="Apple-tab-span"> </span>tree[u][parent[u]] = d[u];</p><p><span class="Apple-tab-span"> </span>//tree[k++][2] = u;</p><p><span class="Apple-tab-span"> </span>for (v = 1; v <= n; v++)</p><p><span class="Apple-tab-span"> </span>if (!visited[v] && (cost[u][v] < d[v]))</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>d[v] = cost[u][v];</p><p><span class="Apple-tab-span"> </span>parent[v] = u;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>return (stcost);</p><p>}</p><p><br></p><p>void prims :: display(int cost)</p><p>{</p><p><span class="Apple-tab-span"> </span>int i;</p><p><span class="Apple-tab-span"> </span>cout << " The Cost Matrix of the Mininum Spanning Tree is ";</p><p><span class="Apple-tab-span"> </span>for (i = 1; i <= n; i++)</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>for( int j = 1; j<= n; j++ )</p><p><span class="Apple-tab-span"> </span>{</p><p><span class="Apple-tab-span"> </span>cout << tree[i][j] << " ";</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>cout<< endl;</p><p><span class="Apple-tab-span"> </span>}</p><p><span class="Apple-tab-span"> </span>cout << " The Total cost of the Minimum Spanning Tree is : " << cost<<" ";</p><p>}</p><p><br></p><p>int main()</p><p>{</p><p><span class="Apple-tab-span"> </span>int source=0;</p><p><span class="Apple-tab-span"> </span>int treecost = 0;</p><p><span class="Apple-tab-span"> </span>prims pri;</p><p><span class="Apple-tab-span"> </span>source=pri.readmatrix();</p><p><span class="Apple-tab-span"> </span>pri.init();</p><p><span class="Apple-tab-span"> </span>cout<<" Source Vertice Is : "<<source;</p><p><span class="Apple-tab-span"> </span>/*cout << " Enter the Source : ";</p><p><span class="Apple-tab-span"> </span>cin >> source;*/</p><p><span class="Apple-tab-span"> </span>treecost = pri.spanningtree(source);</p><p><span class="Apple-tab-span"> </span>pri.display(treecost);</p><p><span class="Apple-tab-span"> </span>system("pause");</p><p><span class="Apple-tab-span"> </span>return 0;</p><p>}</p><div><br></div></p>Explanation / Answer
please post it again with spaces..cant even copy it to command wondows.
Related Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.