ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

47 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

23h 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

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

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

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
5 Algorithms That Generate Perfect Mazes, Compared

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
5 Algorithms That Generate Perfect Mazes, Compared

12,134 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

The Logic Blueprint
The One Edge Rule Behind Every MST (Cut Property Explained)

CP-Algorithms — Kruskal's Algorithm and Disjoint Set Union https://cp-algorithms.com/graph/mst_kruskal_with_dsu.html A useful ...

5:03
The One Edge Rule Behind Every MST (Cut Property Explained)

166 views

6d 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

Computer Science by RKG
Every Graph Algorithm Time Complexity in One Video

... V) - Prim's Minimum Spanning Tree: Priority queue analysis and O((V + E) log V) - Kruskal's Algorithm: Edge sorting and Disjoint ...

13:33
Every Graph Algorithm Time Complexity in One Video

42 views

5d ago

AcademicArk
AKTU DAA Unit 3 Important Questions 2026 | Kruskal, Dijkstra & Greedy PYQs (BCS503)

... Topics covered: • Dijkstra's Algorithm and negative edge weights • Kruskal's Algorithm and Minimum Spanning Trees • Prim's vs ...

6:52
AKTU DAA Unit 3 Important Questions 2026 | Kruskal, Dijkstra & Greedy PYQs (BCS503)

18 views

3d ago

Geek's Lesson
Big O Notation & Arrays Explained | Data Structures and Algorithms Part 1

Part 1 of our 15-part Data Structures and Algorithms course, in Python: Parts 1–10 teach the core ideas, Parts 11–15 solve classic ...

15:39
Big O Notation & Arrays Explained | Data Structures and Algorithms Part 1

1,350 views

1d ago

INFOSTREAM KANNADA
Huffman tree problem  | Analysis and Design of Algorithms | All Universities

Whatsapp group link : https://chat.whatsapp.com/FUlSSiE0hPa7Jh3SLUut8t module 4 playlist ...

11:00
Huffman tree problem | Analysis and Design of Algorithms | All Universities

8 views

13h ago

INFOSTREAM KANNADA
Huffman tree problem  | Analysis and Design of Algorithms | All Universities

Whatsapp group link : https://chat.whatsapp.com/FUlSSiE0hPa7Jh3SLUut8t module 4 playlist ...

12:03
Huffman tree problem | Analysis and Design of Algorithms | All Universities

66 views

13h ago

EDUCATA
CPP-298: Minimum Spanning Tree: Core Concepts | C++ DSA & Competitive Programming

C++ DSA and Competitive Programming Course | EDUCATA Video CPP-298: Minimum Spanning Tree: Core Concepts Module: ...

15:51
CPP-298: Minimum Spanning Tree: Core Concepts | C++ DSA & Competitive Programming

0 views

2d ago