Aim :- To find shortest path (Using Dijkstra Algorithm in Networking).

Size: px

Start display at page:

Download "Aim :- To find shortest path (Using Dijkstra Algorithm in Networking)."

Alannah Norman
6 years ago
Views:

1 Aim :- To find shortest path (Using Dijkstra Algorithm in Networking). #include <iostream.h> #include <conio.h> class graph public: char a; char b; int e; ; class dijkstra public: int n,p,t,f; char c[10]; void get_data(); void get_connection(graph g[]); void shortest(graph g[]); void display(graph g[]); int minm(int [],int,char []); int findu(graph g[],int,int,char []); ; void dijkstra::get_data() cout<<"enter number of nodes in your network:"; cin>>n; cout<<endl<<"write the name of each node"<<endl; for(int i=0;i<n;i++) cout<<"name of node "<<i+1<<":"; cin>>c[i]; void dijkstra::get_connection(graph g[]) clrscr(); cout<<endl<<endl<<"now ITS TIME TO CONNECT THE NODES...!"; cout<<endl<<"enter 1 if there is connection between consicutive nodes otherwise enter 0"<<endl; p=0; for(int i=0;i<n;i++) for(int j=i+1;j<n;j++)

2 cout<<c[i]<<" & "<<c[j]<<" :"; int t; cin>>t; if(t==1) g[p].a=c[i]; g[p].b=c[j]; cout<<"enter distance:"; cin>>g[p].e; p++; void dijkstra::display(graph g[]) clrscr(); cout<<"your NETWORK IS LIKE THIS:"<<endl; for(int i=0;i<p;i++) cout<<g[i].a<<" & "<<g[i].b<<" :"<<g[i].e<<endl; void dijkstra::shortest(graph g[]) char s,c[10]; int q,d[10]; cout<<endl<<endl<<"now ENTER NODE from which you want to find shortest distance:"; cin>>s; t=0; f=0; //function to get distance & node array (Initialization) for(int r=0;r<n;r++) if(s!=c[r]) C[f]=c[r]; for(int i=0;i<p;i++) if((g[i].a==s && g[i].b==c[f]) (g[i].a==c[f] && g[i].b==s)) D[f]=g[i].e; q=0; break;

3 if(q!=0) D[f]=32767; f++; int w,u,v; //greedy loop for(q=0;q<n-2;q++) v=minm(d,f,c); for(w=0;w<f;w++) if(c[w]!=null && C[w]!=C[v]) u=findu(g,w,v,c); D[w]=(D[w]<(u+D[v])?D[w]:(u+D[v])); C[v]=NULL; cout<<"the sortest distance from node "<<s<<":"; for(int z=0;z<f-1;z++) cout<<d[z]<<","; cout<<d[f-1]; int dijkstra::findu(graph g[],int w,int v,char C[]) for(int z=0;z<p;z++) if((g[z].a==c[w] && g[z].b==c[v]) (g[z].a==c[v] && g[z].b==c[w])) return g[z].e; return 32676; int dijkstra::minm(int j[],int t,char c[]) int o=32766,q; for(int i=0;i<t;i++) if(o>j[i] && c[i]!=null)

4 o=j[i]; q=i; return q; void main () clrscr(); graph g[15]; dijkstra d; d.get_data(); d.get_connection(g); d.display(g); d.shortest(g); getch(); Output:

5 // Distances from a to other nodes in sequence (A->B,C,D,E) If distance is from C then read output as (C->A,B,D,E)

6 Kruskal s algorithm #include <iostream.h> #include <conio.h> class graph public: char a; char b; int e; ; class nodes public: char a; char b; ; class node public: char o[10]; ; class kruskal public: int n,p,k[10],u; char c[10]; void get_data(); void get_connection(graph g[]); void shorti(graph g[]); void display(graph g[]); void krush(graph g[],nodes N[],node E[]); int findcomp(char,node E[],int []); ; void kruskal::get_data() cout<<"how much node is their in your network?"; cin>>n; cout<<endl<<"write the name of each node"<<endl; for(int i=0;i<n;i++) cout<<"name of "<<i<<" th node :"; cin>>c[i]; void kruskal::get_connection(graph g[])

7 clrscr(); cout<<endl<<endl<<"now ITS TIME TO CONNECT THE NODES...!"; cout<<endl<<"enter 1 if their is connection between consicutiv node other wise enter 0"<<endl; p=0; for(int i=0;i<n;i++) k[i]=-1; for(int j=i+1;j<n;j++) cout<<c[i]<<" & "<<c[j]<<" :"; int t; cin>>t; if(t==1) g[p].a=c[i]; g[p].b=c[j]; cout<<"enter distance"; cin>>g[p].e; p++; void kruskal::display(graph g[]) for(int i=0;i<p;i++) cout<<g[i].a<<" & "<<g[i].b<<" :"<<g[i].e<<endl; void kruskal::shorti(graph g[]) int key; char x,y; for(int j=1;j<p;j++) int i=j-1; key=g[j].e; x=g[j].a; y=g[j].b; while(i>=0 && key<g[i].e) g[i+1].e=g[i].e; g[i+1].a=g[i].a; g[i+1].b=g[i].b; i--;

8 g[i+1].e=key; g[i+1].a=x; g[i+1].b=y; void kruskal::krush(graph g[],nodes N[],node E[]) E[0].o[0]=g[0].a; E[0].o[1]=g[0].b; N[0].a=E[0].o[0]; N[0].b=E[0].o[1]; k[0]=2; int i=1,z=1,v=0,x; u=1; //To Initialize n nodes for(int m=0;m<n;m++) if(c[m]!=g[0].a && c[m]!=g[0].b) E[u].o[0]=c[m]; k[u]=1; u++; while(z<n-1) v=findcomp((char)g[i].a,e,k); x=findcomp((char)g[i].b,e,k); if(v!=x) N[z].a=g[i].a; N[z].b=g[i].b; int j; for(j=0;j<k[x];j++) E[v].o[k[v]+j]=E[x].o[j]; k[v]=k[v]+j; k[x]=0; z++; i++; else i++;

9 cout<<endl<<"the spanning tree is like:"<<endl; for(int r=0;r<z;r++) cout<<n[r].a<<" & "<<N[r].b<<endl; int kruskal::findcomp(char a,node E[],int k[]) for(int i=0;i<u;i++) for(int j=0;j<k[i];j++) if(e[i].o[j]==a) return i; return 0; void main () clrscr(); graph g[15]; kruskal d; nodes N[10]; node E[10]; d.get_data(); d.get_connection(g); clrscr(); cout<<"your NETWORK IS LIKE THIS:"<<endl; d.display(g); d.shorti(g); cout<<"shorted ages is like"<<endl; d.display(g); d.krush(g,n,e); getch(); Output:

12 Program for Greedy Algorithm: #include<iostream.h> #include<conio.h> int a[10]; class greedy public: static int n,n,l; void make_money(); int get_money(); void avail_coins(); void sort(); ; int greedy::n; int greedy::n; int greedy::l; void greedy::make_money() int A,i=0,b; n=get_money(); avail_coins(); sort(); N=n; while(n!=0) A=N/(int(a[i])); cout<<"\n"<<a[i]<<" amount of coin is"<<a; b=n-(a*a[i]); i++; N=b; void greedy::sort() int j; for(int i=1;i<l;i++) int key=a[i]; j=i-1; while(j+1>0 && a[j]<key) a[j+1]=a[j]; j--; a[j+1]=key;

13 int greedy::get_money() int n; cout<<"enter the amount of bill :"; cin>>n; return n; void greedy::avail_coins() int i=0; cout<<"how many coins u want to take? "; cin>>l; cout<<"\n enter the values for coins :\n"; while(i<l) cin>>a[i]; i++; void main() clrscr(); greedy p; p.make_money(); getch(); Output:

14 Bubble Sort Code: #include<iostream.h> #include<conio.h> class array public: void get_data(int [],int); void ins_sort(void); void display(int [],int,int); void bbl_sort(void); ; void array::get_data(int a[],int n) for(int i=0;i<n;i++) cout<<" enter element"<<i+1<<": "; cin>>a[i]; void array::bbl_sort(void) int i,j,key,a[100],k=0,t,n; cout<<"\nhow many number you want to sort? "; cin>>n; get_data(a,n); for(i=0;i<n-1;i++) for(j=n-1;j>i;j--) key=j-1; if(a[key]>a[j]) t=a[j]; a[j]=a[key]; a[key]=t; k++; cout<<"\n the sorted elements are:"; display(a,n,k);

$void array::display(int a[],int n,int k) for(int i=0;i<n;i++) cout<<"\n"<<a[i];$

15 void array::display(int a[],int n,int k) for(int i=0;i<n;i++) cout<<"\n"<<a[i]; cout<<"\nthenumber of iteration is:"<<k; void main() clrscr(); array p; p.bbl_sort(); getch(); Output :

16 Aim: Quick Sort Algoritham #include<stdio.h> void QuickSort(int A[],int p, int r); int Partition(int A[],int p,int r); int main() int A[8],p=0,r=7,i=0; printf("enter 8 Numbers to Sort Using Quick Sort\n"); for(i=0;i<8;i++) scanf("%d",&a[i]); // Calling Quick Sort Function QuickSort(A,p,r); //Printing Sorted Array printf("sorted Array is As Below:\n"); for(i=0;i<8;i++) printf("%d\n",a[i]); return 0; void QuickSort(int A[],int p, int r) int q; if(p<r) q=partition(a,p,r); QuickSort(A,p,q-1); QuickSort(A,q+1,r); int Partition(int A[],int p,int r) int x=a[r]; int i=p-1; int j,temp; for(j=p;j<r;j++) if(a[j]<=x)

17 i=i+1; // Exchange A[i] with A[j] temp=a[j]; A[j]=A[i]; A[i]=temp; // Exchange A[i+1] with A[r] temp=a[r]; A[r]=A[i+1]; A[i+1]=temp; return i+1; Output:

18 Aim: Algorithm for Merge Sort. #include<stdio.h> #include<math.h> void Merge_Sort(int A[],int p, int r); void Merge(int A[],int p, int q,int r ); int main() int A[8],p=0,r=7,i=0; printf("enter 8 Numbers to Sort Using Merge Sort\n"); for(i=0;i<8;i++) scanf("%d",&a[i]); // Calling Merge Sort Function Merge_Sort(A,p,r); //Printing Sorted Array printf("sorted Array is As Below:\n"); for(i=0;i<8;i++) printf("%d\n",a[i]); return 0; void Merge_Sort(int A[],int p, int r) int q; if(p<r) q=floor((p+r)/2); Merge_Sort(A,p,q); Merge_Sort(A,q+1,r); Merge(A,p,q,r); void Merge(int A[],int p, int q,int r) int n1=q-p+1; int n2=r-q; int L[n1+1],R[n2+1]; int i,j,k; // Counter Variable

19 for(i=1;i<=n1;i++) L[i]=A[p+i-1]; for(j=1;j<=n2;j++) R[j]=A[q+j]; // Infinite means most larger number that is not in Array A L[n1+1]=32000; R[n2+1]=32500; i=1; j=1; for(k=p;k<=r;k++) if(l[i]<=r[j]) A[k]=L[i]; i=i+1; else A[k]=R[j]; j=j+1; Output:

Algorithms Lab (NCS 551)

DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Utter Pradesh Technical University Noida Approved by AICTE Algorithms Lab (NCS 551) SOLUTIONS 1. PROGRAM TO IMPLEMENT INSERTION SORT. #include