Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
102 results
Lecture recordings of CS 566 – Efficient Algorithms (Winter 2025-26) Efficient Algorithms (CS 566) is a second module in ...
30 views
3 weeks ago
DAY 8 – UNIT 2 TOPIC: Minimum Spanning Tree (MST), Prim's Algorithm, Kruskal's Algorithm ...
15 views
2 weeks ago
In this video we will define minimum spanning trees and use Prim's algorithm to draw the minimum spanning tree of a network ...
6 views
Welcome to The DSA Lab! In this video, we dive deep into Prim's Algorithm, one of the fundamental algorithms to find a ...
100 views
4 weeks ago
In this video (Problem #70), we formulate The Minimum Spanning Tree problem: The Minimum Spanning Tree (MST) problem ...
0 views
12 days ago
Coding Channel : https://youtu.be/_1rQZ7S8xHM?si=VrQ-1MSeWkJtPMaP Code Sheet : https://www.notion.so/Data-Structures ...
149 views
8 days ago
📌 New *DSA Sheet* Link: https://dsa.apnacollege.in/ This lecture was made with a lot of love❤️ Company wise DSA Sheet Link ...
2,225 views
2 days ago
Learn Kruskal's Algorithm the easy way! Step-by-step tutorial with simple example, sorting edges, Union-Find cycle detection, and ...
2 views
Minimum Spanning Tree.
5 days ago
Minimum Cost Spanning Tree||DAA.
16 views
Prove that the reverse-delete algorithm always produces a minimum spanning tree when given as input a weighted graph with ...
309 views
Want to master Prim's Algorithm in minutes? In this video, you'll see: How to find a Minimum Spanning Tree step by step How ...
9 views
1 month ago
Learn how Prim's Algorithm works to find the Minimum Spanning Tree (MST) of a graph! In this video, we break down the logic ...
17 views
Learn how to find the Minimum Spanning Tree (MST) of a graph using Kruskal's Algorithm! In this video, we break down the ...
27 views
Kruskal's algorithm is a greedy algorithm to find an MST. It builds the MST edge by edge, always choosing the smallest available ...
1 view
11 days ago
In this video, we explain Strongly Connected Components (SCC) in directed graphs using two classic algorithms from graph ...
12 views
Ever wondered how to connect a network efficiently while keeping costs minimal? From internet cables to power grids, this video ...
6 days ago
Today's Discrete Mathematics class focused on Trees and their key applications. We began with the concept of spanning trees ...
8 views