49 C Program to implment Dijkstra's Algorithm to find shortest path from a given source vertex

[@satvikmanchanda7090]

Thank you sir, you did a great job

[@AshishBennyBPS]

thanks for the code,sir

[@darshinisiripuram5167]

❤ thank u sir

[@arvindkr8966]

thankyou sir

[@shatishkumars9504]

Nice.... 💯

[@chanu2400]

Thank you sir

[@pushpraj__]

thank you so much sir for this lecture.

[@acousticrahul1773]

Full on pdhai

[@Akash-oz3xs]

Wht about o/p sir

[@nobimomedits2460]

sir is to innocent and understanding...we needed such professors in our college...and a humble request sir..create a new where you explain all these algos in hindi..it will be helpful for many students to understand concepts easily...overall thank you sir for explaining this

[@royalboy850]

Sir can you upload np and np complete class for unit 5 we have cie on coming Tuesday

[@datastructuresalgorithmsby7411]

Send me ur mail id

[@vishwajitjadhav1170]

sir can you give written program

[@datastructuresalgorithmsby7411]

I didn't get what u meant by written program

[@RiteshKumar-ud7bf]

@@datastructuresalgorithmsby7411 Sir, he meant like this:
#include
#include
void dijkstra(int n,int cost[10][10],int s,int dist[10])
{
int i,v,count=1,min,visited[10];
for(i=1; i

[@manasigurav1538]

Why 16 values. Why square of number values will be take?

[@akhilkrishnahere]

@@RiteshKumar-ud7bf do you have the correct code?

[@RiteshKumar-ud7bf]

@@akhilkrishnahere No. I don't have it.

[@Ckpersonal123]

explain it clearly while writing code dont write simply ..................

[@RohanSingh-fv2xg]

Know C, kid.

[@dankmemes3859]

This cod e isn't working !!

[@arvindkr8966]

bhai its working properly
I used the code in VS Code
it gave me correct output

[@nbsaismaran7]

@@arvindkr8966 can u post the code

[@akhilkrishnahere]

for sure?

[@future_engineer020]

Thanks a lot sir🙆‍♂️
This is complete written code 😀:
//Dijkstra code
//with time complexity
#include
#include
void dij(int n, int cost[10][10], int s, int dist[10]) {
int i, v, count = 1, min, visited[10];
for (i = 1; i

[@datastructuresalgorithmsby7411]

Thank u very much

[@anjankumarkantepalli8623]

nv devudivi sami...🙏🙏

[@yeeehaww69yearsago81]

working code- #include
#include
void prn(int n, int m[][50]) {
printf("
");
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
printf("%d\t", m[i][j]);
}
printf("
");
}
}
void dijkstra(int n, int s, int m[][50], int dist[10]) {
int i, v, count = 1, min, visited[10];
for (i = 1; i

[@akshaypandit8332]

ty brother

[@praveenkumargd]

Thanks bro