dijkstra gives shortest path from one node to every other node so why not just run dijkstra for every node and store them we will have time complexity of O(n^2 logn) and easier to impliment as compared to this. edit: learn this algo guys this dijkstra thing don't always work i learnt it hard way
@@omingole7304 actually the time compexity of dijsktra depends on edge, its i think O(E log v), and in complete connected graph edge can be in order of n^2, if there we want shortest path from every node to every other node then floys warshall performs better since its tc would be O(n^3) while dijkstra would be something around O(n^3 log n)
@@kushagra4401 no bro in case of dijsktra we can find for negative weight edges because of that it fall into TLE but for dijsktra actually it taking O(N*E*log(N)) time complexity and for floys warshall it will be O(N^3)
though i don't have much experience about java , but i have encountered some cases where my literally same code in cpp got accepted but my firned's java one gave tle.
Why cant we use dijkstra for all pairs? Instead of 1 as starting point, use which node you want to start with and perform pre-computation. For shortest distance between 2 and 5. Start dijkstra for 2 and pre-compute all nodes. It is working fine for me
You teach just like a friend does before exam day. Fast, exact and to the point. Awesome content!
well said :)
Hum first hum first🔥
👏👏💯great content. Simple and to the point.
please keep making videos like these, thank you!! 💚
dijkstra gives shortest path from one node to every other node so why not just run dijkstra for every node and store them we will have time complexity of O(n^2 logn) and easier to impliment as compared to this.
edit: learn this algo guys this dijkstra thing don't always work i learnt it hard way
can u tell when djikstra does not work?
@@omingole7304 actually the time compexity of dijsktra depends on edge, its i think O(E log v), and in complete connected graph edge can be in order of n^2, if there we want shortest path from every node to every other node then floys warshall performs better since its tc would be O(n^3) while dijkstra would be something around O(n^3 log n)
@@kushagra4401 no bro in case of dijsktra we can find for negative weight edges because of that it fall into TLE but for dijsktra actually it taking O(N*E*log(N)) time complexity and for floys warshall it will be O(N^3)
Thanks bro , COMPETITIVE PROGRAMMING to acha ho gaya apke video dek ke please open souce ka bhi guide kar do please
Love you bhaiya love you...
Bhaiya c++ me ek project bataiye na final year ke liye
Nice explanation..thanks sir..
Competitive programming ka god 🙏❤️❤️❤️❤️
Thanks belongs to infinity brother!
❤
can i do competitive programming in java?? will i regret later for not choosing c
++? i am much interested in java , thus chose java.
though i don't have much experience about java , but i have encountered some cases where my literally same code in cpp got accepted but my firned's java one gave tle.
@@kushagra4401 oo..I see..
Which software u use for these red lines???
amazing content💚💚💚💚
💛 => I have a suggestion, along with advanced graph algorithm video share 5 medium-hard quality problems links to practice.
sir, how many videos are left for the graph?
Bhiya video ki frequency increase kr do please..
One word for you only Great 👍👍👍👍
please reduce the music volume slightly. because it's covering your voice. nice work
6:40 ke baad se samj nahi aaya bhaiya
Bhiya is your number theory playlist complete
yes
Why cant we use dijkstra for all pairs? Instead of 1 as starting point, use which node you want to start with and perform pre-computation. For shortest distance between 2 and 5. Start dijkstra for 2 and pre-compute all nodes. It is working fine for me
i guess its same thing
Can u plz provide the code
Bhaiya, when will you cover linked lists, binary trees?
not planning to cover them
@@iamluv next topic then?
Please make videos on bfs in 2d traversal
Sorry bhai, but samaj me nahi aaya
11-aug 2022
💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛
Bhaiya 510 Leetcode questions ho gaye h ab bas 990 aur 🙂🌝
wow , daily kitne ques krte ho?
@@rishav144 3-4
bro codeforces me kitni rating hai ?
@@shy6489 2023
@@unknown_coder7960 kitna time laga bro tumhe, kaunse year me ho ?
💛💛💛💛💛💛💛💛
💛💛💛
🔥🔥🔥
nice
इस को रट्टा लगवाना कहते है😂😂😂😂😂😂, बस steps रट लो और लो हो गया😂😂😂😂😂और कॉमेंट्स सब तालिया भी बजा रहे है 😂😂😂😂😂
we want a JAVA course
plz.
💚💚
💚
8
♥
😍
please make new videos
💚💚💚💚💚
❤️❤️❤️❤️🙏🙏
वीडियो मे कोई सरल भाषा का इस्तेमाल कीजिए sir🙏
it's is not good explanation.You miss the main point of Floyd Warshall.
💔💔
💛💛💛
💛
💚💚💚
💚💚💚💚💚
😍
💚
💚💚💚💚💚💚
💚💚💚
💛
💚
💚💚
💛
💚
💚💚💚
💛
💚
💛
💚
💚
💛
💛
💚
💛
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚