Shortest Path | Dijkstra's Algorithm Explained and Implemented in Java | Graph Theory | Geekific

Video Description

Discord Community: https://discord.gg/dK6cB24ATp GitHub Repository: https://github.com/geekific-official/ Finding the shortest path between two vertices of a given graph is a classic yet a fundamental theoretic problem known in graph theory. Dijkstra's Algorithm is one of the many algorithms out there that addresses this problem, and the subject of today’s video. Timestamps: 00:00 Introduction 00:40 Dijkstra's Algorithm Explained 04:04 Dijkstra's Algorithm Implemented 06:40 Putting our Code to the Test 07:24 Thanks for Watching! If you found this video helpful, check other Geekific uploads: - Object-Oriented Programming Fundamentals: https://youtu.be/Vfk6sExu8-4 - SOLID Principles and Best Practices: https://youtu.be/HoA6aZPR5K0 - Recursion Made Simple, Recursive Methods: https://youtu.be/r8KJ2AJWkHs - Use-Case and Sequence Diagrams: https://youtu.be/el501qi0KtI - What is a Thread? (Process, Program, Parallelism, Scheduler Explained): https://youtu.be/hN2Yrf4tqTY - Project Lombok Annotations Explained: https://youtu.be/sPgTC-e6QyY - Java's Stream API Explained with Examples: https://youtu.be/W1ddeJAuGA4 - Graphs - The Fundamentals: https://youtu.be/UUuFT5K6zrI - Trees Compared and Visualized, BST vs AVL vs Red-Black vs Splay vs Heaps: https://youtu.be/hmSFuM2Tglw - Ford-Fulkerson Algorithm Explained and Implemented in Java: https://youtu.be/sT9dpVRKrQY - Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance: https://youtu.be/FXAUXvPNKi8 #Geekific #Dijkstra #ShortestPath #GraphTheory