ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

159 results

The Logic Blueprint
Prim’s Algorithm Explained: Build a Minimum Spanning Tree Step by Step

Learn graph algorithms and greedy algorithms through a clear, visual walkthrough of **Prim's algorithm**. In this video, we build a ...

5:27
Prim’s Algorithm Explained: Build a Minimum Spanning Tree Step by Step

21 views

5d ago

1111 Engineering Lecture
Prim's Algorithm | Definition, Steps & Solved Example Problem | 1111 Engineering Lecture

Welcome to 1111 Engineering Lecture! In this video, we learn Prim's Algorithm, an important greedy algorithm used to find the ...

8:10
Prim's Algorithm | Definition, Steps & Solved Example Problem | 1111 Engineering Lecture

7 views

22h ago

DeepNode
Minimum Spanning Tree in C++ — Prim's vs Kruskal's and the Cut Property | C++ DSA #137

A spanning tree connects every node of a connected graph with exactly n−1 edges (a tree ON the graph). In this episode of ...

10:33
Minimum Spanning Tree in C++ — Prim's vs Kruskal's and the Cut Property | C++ DSA #137

3 views

2d ago

Laksh
DAA | SPURS 2025 | Graph Algorithms | Minimum Spanning Tree | Prim's and Kruskal's
15:17
DAA | SPURS 2025 | Graph Algorithms | Minimum Spanning Tree | Prim's and Kruskal's

28 views

4d ago

NLX Studio
Which Algorithm Builds a Maze Fastest? 🧱 7 Races (DFS vs Prim vs Kruskal)

Pick your winner before the first race! 9 maze-generation algorithms race to build a perfect maze, step by step: DFS vs Prim, ...

8:03
Which Algorithm Builds a Maze Fastest? 🧱 7 Races (DFS vs Prim vs Kruskal)

7 views

1d ago

Menaka B
Prim s   Kruskal s
6:26
Prim s Kruskal s

0 views

6d ago

EDUCATA
CPP-300: Prim’s Minimum Spanning Tree Algorithm | C++ DSA & Competitive Programming

C++ DSA and Competitive Programming Course | EDUCATA Video CPP-300: Prim's Minimum Spanning Tree Algorithm Module: ...

14:25
CPP-300: Prim’s Minimum Spanning Tree Algorithm | C++ DSA & Competitive Programming

0 views

2d ago

IBDemystified
Finding the Cheapest Connecting Network: Prim | IB Maths AI HL

Finding the Cheapest Connecting Network: Prim: a clear, step-by-step lesson for IB Maths AI HL (IB Diploma Programme).

10:34
Finding the Cheapest Connecting Network: Prim | IB Maths AI HL

3 views

4d ago

RisingBrain
Kruskal’s Algorithm Explained | Minimum Spanning Tree (MST) | Graphs | DSA

Kruskal's Algorithm is a greedy graph algorithm that finds the Minimum Spanning Tree by selecting edges in increasing order of ...

15:27
Kruskal’s Algorithm Explained | Minimum Spanning Tree (MST) | Graphs | DSA

994 views

4d ago

Suresh Devanapalli
DM-26: Minimum Spanning Tree: Prim's Algorithm

Minimum Spanning Tree: Prim's Algorithm.

19:18
DM-26: Minimum Spanning Tree: Prim's Algorithm

238 views

Streamed 1d ago

Rogue's Den
How Computers Build Perfect Mazes (5 Algorithms)

One click, and a new maze appears. But how does a computer actually build a perfect maze, one with exactly one path between ...

9:03
How Computers Build Perfect Mazes (5 Algorithms)

12,126 views

4d ago

The Logic Blueprint
Kruskal’s Algorithm Explained: The MST Trick Behind Graph Problems

Graph Algorithms become much easier when you stop thinking about every possible path and focus on the edges that matter.

6:03
Kruskal’s Algorithm Explained: The MST Trick Behind Graph Problems

25 views

4d ago

VCI Labs
Lec 11 - Greedy Graph Algorithms

... *Kruskal's algorithm* : building an MST by adding the cheapest edges that don't form a cycle ✓ *Prim's algorithm* : growing an ...

33:18
Lec 11 - Greedy Graph Algorithms

10 views

1d ago

Techmine Guru
#viral How to Master Graph BFS, Rotten Oranges & Prim's Algorithm in DSA

GraphBFS #RottenOranges #PrimsAlgorithm #viral How to Master Graph BFS, Rotten Oranges & Prim's Algorithm in DSA Graph ...

1:05:08
#viral How to Master Graph BFS, Rotten Oranges & Prim's Algorithm in DSA

3 views

6d ago

(Mr Sayed Khalil)MathWay
Page 55

📚 Prim 5 Mathematics – Unit 4 🎯 Lessons 3, 4 & 5 In this video, we will cover three important Maths lessons: 🔹 Lesson 3 ...

39:56
Page 55

5 views

7h ago

EDUCATA
CPP-415: Minimum Spanning Tree: Advanced Applications | C++ DSA & Competitive Programming

... 00:48 Recap: Kruskal's vs Prim's Algorithms 01:39 Visualizing Kruskal vs Prim Graph Operations 02:16 Bottleneck Connectivity ...

9:18
CPP-415: Minimum Spanning Tree: Advanced Applications | C++ DSA & Competitive Programming

1 view

22h ago