The implementation of UCS Algorithn in c++?

Question

I mean I want to ask user to enter the adjacency matrix size then fill the elements of that then after that implement UCS algorithm and finally show the output in a file.

Ali Ahmed · Answer

Please try to implement any algorithm yourself. It helps you a lot in programming. I do this code my own way thats why I share this code. Please try to understand that code and implement your own way. # include stdio.h > # include cstdio > # include vector > # include queue > # include cstring > using namespace std ; # define inf 1000000000 int dist[ 5000 ][ 5000 ]; int ar[ 10000 ][ 10000 ]; bool mark[ 1000 ][ 1000 ]; int xy; int I[]= { 0  1 }; int J[]= { 1  0 }; struct data { int addaddis; data ( int a int a1 int b) { add=a; ad=a1; dis=b; } bool operator const data &x) const { return dis>x. dis ; } }; int dijkstra ( int start1 int start2 int end1 int end2) { dist[start1][start2]=ar[ 0 ][ 0 ]; int iuvt; priority_queue Q; Q. push ( data (start1start2dist[start1][start2])); while (!Q. empty ()) { data rt=Q. top (); Q. pop (); if (rt. add ==x- 1 &&rt. ad ==y- 1 ) return dist[end1][end2]; for (i= 0 ; i 2 ; i++) { u=rt. add +I[i]; v=rt. ad +J[i]; if (u>= 0 &&u = 0 &&v { t=dist[rt. add ][rt. ad ]+ar[u][v]; if (dist[u][v]>t) { dist[u][v]=t; Q. push ( data (uvdist[u][v])); } } } } } int main () { int iknmpabzjvans; scanf (  %d  &a); for (i= 0 ; i { memset (mark 0  sizeof (mark)); scanf (  %d%d  &x&y); for (j= 0 ; j { for (k= 0 ; k { scanf (  %d  &ar[j][k]); dist[j][k] = inf; } } //memset(dist10sizeof(dist)); ans= dijkstra ( 0  0 x- 1 y- 1 ); printf (  %d 
  ans); } return 0 ; }