L-5.7: Introduction to All Pair Shortest Path (Floyd Warshall Algorithm)
Gate Smashers
0:00 / 0:00
L-5.7: Introduction to All Pair Shortest Path (Floyd Warshall Algorithm)
668 001 просмотр · 5 лет назад
Gate Smashers
2,84 млн подписчиков
668 001 просмотр · 5 лет назад
In this video, Varun sir will discuss about Floyd Warshall Algorithm — a powerful method used to find the shortest paths between all pairs of nodes in a weighted graph. Whether you're a beginner exploring graph algorithms or preparing for tech interviews, this session will help you understand the concept, working, and real-life applications of the All Pair Shortest Path problem in a simple, intuitive way. No prior advanced math required. #algorithm
--------------------------------------------------------------------------------------------------------------------------------------
Timestamps:
00:10 – Introduction to All Pairs Shortest Path
01:01 – Single Source Shortest Path
02:54 – Transition to All Pairs Shortest Path
03:35 – Time Complexity (Using Dijkstra)
05:30 – Need for Efficient Algorithm
--------------------------------------------------------------------------------------------------------------------------------------
🚀 MASTER COMPUTER SCIENCE | INTERVIEWS | EXAMS
Gate Smashers — Learn Computer Science through free lectures, structured playlists, interview resources, important questions, notes & exam preparation. 💻📚
🌐 FREE CS RESOURCES & INTERVIEW PREPARATION : https://gatesmashers.com
━━━━━━━━━━━━━━━━━━━━━━
📚 SUBJECT-WISE COMPUTER SCIENCE PLAYLISTS
► Placement Interview Questions: • Placement Interview Questions | One Shot S...
► System Design: • System Design
► Deep Learning: • Deep Learning (ANN, RNN, Tranformers, RNN)
► Machine Learning:
• Machine Learning
► Design and Analysis of Algorithms (DAA): • Design and Analysis of algorithms (DAA)
► Software Engineering: • Software Engineering
► Database Management System (DBMS): • DBMS (Database Management system) Complete...
► Cloud Computing: • Cloud Computing (Complete Course)
► Theory of Computation (TOC): • TOC(Theory of Computation)
► Artificial Intelligence: • Artificial Intelligence (Complete Playlist)
► Computer Networks (CN): • Computer Networks (Complete Playlist)
► Operating System (OS): • Operating System (Complete Playlist)
► Structured Query Language (SQL): • Structured Query Language (SQL)
► Discrete Mathematics: • Discrete Mathematics
► Compiler Design: • Compiler Design (Complete Playlist)
► Number System: • Number system
► Programming in C: • C Programming
► Data Structures: • Data Structure
► Computer Architecture: • Computer Organization and Architecture (Co...
► Graph Theory: • Graph Theory
► Digital Logic: • Digital Logic (Complete Playlist)
━━━━━━━━━━━━━━━━━━━━━━
🌐 CONNECT WITH GATE SMASHERS
► Website: https://gatesmashers.com
► YouTube: / gatesmashers
► Instagram: / gate.smashers
► Telegram: https://t.me/gatesmashersofficial
► Facebook: / gatesmashers
► Threads: https://threads.net/@gate.smashers
GsetGo
► YouTube: / @gsetgoofficial
► Instagram: / gsetgo_
VarunNainaShots
► YouTube: / @varunainashots
► Instagram: / varunainashots
━━━━━━━━━━━━━━━━━━━━━━
Subscribe to Gate Smashers and start your Computer Science learning journey today! 🚀💻