I'm just amazed by the efforts that u've put in making this video...u could've easily skipped the tedious part but u rather decided to show it. Thnx man...commendable efforts there :)
Very nicely explained! Having the patience to explain 64 iterations really is impressive, and makes for a really clear explanation and makes this easy to understand
This is what I called quality...after soo many years...this channel is still the number one choice for algos... That's what I call quality...never lost in the transition of time...other videos or channel might have lost their name/fame in the span of all these years... May your soul be at rest man...RIP
I wonder who dislikes this video. If i would have not understood anything then also i would have upvoted it by seeing the efforts this man puts to make others understand.
Thanks a lot!!! ur videos helped me a lot to go through my exams!!! so clear and always points out the underline concepts and time complexities. perfect!
you just explained 64 iterations .....!!!!btw did you write the iterations yourself ?? if you did ..you definitely deserve a cookie ... btw awesome explanation..
One thing, As mentioned by tushar sir in the very begining of video, it can detect negetive weigth cycle, as per my understanding, It can not detect negetive weight cycle, It can only work for negetive weight edges, with precondition, there is no negetive weigth cycle.
A good explanation Tushar! Thanks for this video. It greatly helped me to understand the basics of this algorithm. If you can reduce the pace of delivery of speech and re-record, the overall effect will be awesomer! Thanks! :)
Could you explain the situation when there is more than one shortest path between two nodes. How can we modify the algorithm ? Explained in a very nice way. Following your videos thoroughly for my course on algorithms.
The working is great , but what about explanation ? 1) This is an APSP problem -All pair shortest path problem unlike Djikstra ( SSSP - Single source shortest path ) 2) This method is based on dynamic programming - breaking up each path into sub problems by considering other paths via other vertices. 3) The same functionality as this method can be obtained using Djikstra for each vertex.
Great video! I had a doubt. You talked about negative weight cycle detection by checking if there is any negative value along the diagonal in the matrix. Can you please explain the reason behind it? Thanks in advance!
This is to indicate the "previous vertex in the path". For example, for 0->1, 0->2, and 0->3 edges, the "0" in the path matrix simply means that to reach vertices 1, 2, and 3, you start with 0. Similar with 1->2, "1" in the matrix means that vertex 2 is reachable from vertex 1.
Very nice way of explanation... Your Extra efforts made it more easy... Thanks alot... Btw I was searching for C programming for this, can u please provide a link for it?
thank you for your information .. can you tell me can this algorithm solve the Traveling Salesman Problem ? and can you give me the example with another video ?
Could you please explain to me if it is possible with a Given a graph G=(V, E), we may wish to find out whether there is a path in the graph from i to j for all vertex pairs. how we can use Floyd-Warshall to identify transitive closure?
+Kalev Ingemart No, I think it's right. The path[2]]1]=0 means: 2->3->0->1, which is correct. What you saying is that path[2][1]=3 means: 2->3->1, and there is no edge form 3 to 1.
I am very sory..to say that..Tushar sir I m not able to understand this path matrix u had created in this session..its an humble request to get me over that only path matrix explaination… sir.. or any friends wo get the answer..plz do reply soon I have my semesters very soon!!!!!
