0
What else can I help you with?
Where is there a tropical location starting with the letter j?
R u a J locatian???? The letter J is the start of the Alphabet!
Attitude starting with J?
An attitude starting with J is jolly.
An Exotic Location that starts with the letter J?
Jamaica is an exotic location. It begins with the letter J.
Nouns starting with J?
Examples of nouns starting with J are:jackjackaljacketjackrabbitjadejaguarjailjalopyjamJamaicajamboreeJanuaryJapanjarjasminejasperjavelinjawjayjazzjealousyjeerjellyjellyfishjeopardyjetjeweljewelryjimsonweedjinglejittersjoggerjokejonquilJordanjournaljourneyjubileejudgejuggernautjugularJulyjumperJunejunglejuniperjunkJupiterjuryjustice
Activity starting with j?
An activity starting with J is jumping rope.
Car names starting with j?
Car names starting with J are Jaguar and Jeep.
Acolour starting with letter j?
A color starting with the letter J is jade green.
Is there a word starting with you and ending with j?
There is no English word that starts with you and ends with J.
What is Virginia's relative location?
j
How do you write a c program for Djikstra's shortest path algorithm?
#include<stdio.h> #include<conio.h> #include<string.h> #define MAX 20 void dijkstra(int adj_matrix[MAX][MAX],int total, int startnode,int destnode,char location[MAX][MAX]) { int cost[MAX][MAX],distance[MAX],pred[MAX]; int visited[MAX],count,mindistance,nextnode,i,j; const int INFINITY = 9999; for(i=0;i<total;i++) { for(j=0;j<total;j++) { if(adj_matrix[i][j]==0) cost[i][j]=INFINITY; else cost[i][j]=adj_matrix[i][j]; } } for(i=0;i<total;i++) { distance[i]=cost[startnode][i]; pred[i]=startnode; visited[i]=0; } distance[startnode]=0; visited[startnode]=1; count=1; while(count<total-1) { mindistance=INFINITY ; for(i=0;i<total;i++) { if(distance[i] < mindistance && !visited[i]) { mindistance=distance[i]; nextnode=i; } } visited[nextnode]=1; for(i=0;i<total;i++) { if(!visited[i]) { if(mindistance+cost[nextnode][i]<distance[i]) { distance[i]=mindistance+cost[nextnode][i]; pred[i]=nextnode; } } } count++; } printf("\nShortest Distance from %s to %s = %d units\n",location[startnode],location[destnode],distance[destnode]); printf("\nPath = %s",location[destnode]); j=destnode; do { j=pred[j]; printf(" <- %s",location[j]); }while(j!=startnode); } int search(char source[MAX][MAX],char string[MAX]) { int i; for(i=0;i<MAX;i++) { if(stricmp(source[i],string)==0) return i; } return -1; } void main() { char location[MAX][MAX],start[MAX],dest[MAX]; int total,i,j,adj_matrix[MAX][MAX]; clrscr(); printf("\nEnter the number of locations you are going to enter\t"); scanf("%d",&total); printf("\nEnter the name for %d locations...\n",total); for(i=0;i<total;i++) { printf("\nLocation %d ==> ",i); scanf("%s",location[i]); } for(i=0;i<total;i++) { j=i; while(j<total) { if(i==j) { adj_matrix[i][j]=0; } else { printf("\nEnter distance from %s to %s\t",location[i],location[j]); scanf("%d",&adj_matrix[i][j]); adj_matrix[j][i] = adj_matrix[i][j]; } j++; } } printf("\nEnter starting location\t"); scanf("%s",start); i = search(location,start); printf("\nEnter destination location\t"); scanf("%s",dest); j = search(location,dest); if(i==-1) printf("\nInvalid Starting Location Entered..."); else if(j==-1) printf("\nInvalid Destination Location Entered..."); else dijkstra(adj_matrix,total,i,j,location); getch(); } Written by: Fabianski Benjamin
What is a state starting with J?
There are no US states that start with a J
What has the author P J McDermott written?
P. J. McDermott has written: 'Industrial organisation and location' -- subject(s): Electronic industries, Industrial location, Industrial organization, Location
