ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

31 results

Decoding CS solutions
Kruskal's Algorithm Explained with Example | Minimum Spanning Tree (MST) | DAA

Learn Kruskal's Algorithm in the simplest way with a step-by-step example! In this video, you'll understand: ✓ What is Kruskal's ...

11:56
Kruskal's Algorithm Explained with Example | Minimum Spanning Tree (MST) | DAA

2 views

11 hours ago

Arun Tyagi
Kruskal's Algorithm | Minimum Spanning Tree + Union-Find Explained | Graph Series

Kruskal's algorithm builds a Minimum Spanning Tree (MST) by always picking the cheapest edge that does not create a cycle.

35:59
Kruskal's Algorithm | Minimum Spanning Tree + Union-Find Explained | Graph Series

12 views

1 day ago

K-State Math
1.3.3 Proof of Kruskal's Algorithm

A minimal spanning tree is a tree that has a minimal total weight right and from the minimal spanning trees choose t prime to be uh ...

14:36
1.3.3 Proof of Kruskal's Algorithm

1 view

4 days ago

Nexmynd
Kruskal's Algorithm vs Prim's Algorithm | Spanning Tree & Minimum Spanning Tree (MST)

Welcome to Lecture 13 of our Data Structures & Algorithms (DSA) Series! In this lecture, we will learn Spanning Tree, Minimum ...

17:47
Kruskal's Algorithm vs Prim's Algorithm | Spanning Tree & Minimum Spanning Tree (MST)

11 views

1 day ago

Benchmark Battle
The problem that finally defeated Claude | Project Euler 107

The goal is to find the minimum spanning tree — the cheapest set of connections that keeps every node reachable — and report ...

8:39
The problem that finally defeated Claude | Project Euler 107

71 views

6 days ago

Ramin T.
Neetcode  Find Critical and Pseudo Critical Edges in Minimum Spanning Tree (Prim's Algorithm)

You are given a weighted undirected connected graph with n vertices numbered from 0 to n - 1, and an array edges where ...

14:46
Neetcode Find Critical and Pseudo Critical Edges in Minimum Spanning Tree (Prim's Algorithm)

1 view

6 days ago

Success4NET
UGC NET DEC 2026 | Computer Science | Unit 1:Discrete Structures & Optimization-Graph Theory-Class 9

Welcome to Class 9 of the UGC NET December 2026 Computer Science series! In this lecture, we continue Unit 1: Discrete ...

17:37
UGC NET DEC 2026 | Computer Science | Unit 1:Discrete Structures & Optimization-Graph Theory-Class 9

4 views

1 day ago

codingchannel
Graph Theory

Agar aap Data Structures and Algorithms (DSA) me master banna chahte hain aur Graph Theory ko bilkul basic se advanced ...

17:19
Graph Theory

4 views

5 days ago

STUDENT NEEDS
Prims Algorithm With Example | AOA SY

... Prims algorithm How to solve the prims algorithm Prim's algorithm for minimum spanning trees Aoa prims algorithm Easy way to ...

12:53
Prims Algorithm With Example | AOA SY

3 views

1 day ago

Success4NET
UGC NET DEC 2026 | Computer Science | Unit 1:Discrete Structures & Optimization-Graph Theory-Class 8

Welcome to Class 8 of the UGC NET December 2026 Computer Science series! In this lecture, we continue Unit 1: Discrete ...

18:27
UGC NET DEC 2026 | Computer Science | Unit 1:Discrete Structures & Optimization-Graph Theory-Class 8

25 views

2 days ago

Adda247 Engineers - AE JE Exams
Coal India MT 2026 | Hashing & MST Complete Class | Computer Science

To access the video and other study materials on Adda247 app, click - https://adda247.go.link/5K3Pr . Master essential data ...

57:16
Coal India MT 2026 | Hashing & MST Complete Class | Computer Science

1,058 views

Streamed 3 days ago

LetMeTeach
Tree Traversal Visual Trick — Find Inorder, Preorder, Postorder | Computer Science

Are you struggling to write down Inorder, Preorder, and Postorder traversals for binary trees in your exams? Doing it the traditional ...

2:06
Tree Traversal Visual Trick — Find Inorder, Preorder, Postorder | Computer Science

3 views

4 days ago

Davi LUiz
Trabalho de Algoritmos de Grafos sobre Algoritmos de AGM

Nomes: Davi Luiz, Rodrigo L. Barbosa.

12:07
Trabalho de Algoritmos de Grafos sobre Algoritmos de AGM

5 views

6 days ago

Success4NET
UGC NET DEC 2026 | Computer Science | Unit1:Discrete Structures & Optimization-Graph Theory-Class 10

... Traversal Techniques Spanning Trees Minimum Spanning Tree Problems Graph Algorithms Connected Components Practice ...

26:28
UGC NET DEC 2026 | Computer Science | Unit1:Discrete Structures & Optimization-Graph Theory-Class 10

0 views

4 hours ago

Andrew Luck
Trees

This project was created with Explain Everything™ Interactive Whiteboard for iPad. 00:00 Slide 1 00:54 Slide 2 03:31 Slide 3.

6:51
Trees

3 views

5 days ago

Vadim Smolyakov
algorithmic paradigms

Examples include: coin change, minimum spanning tree, shortest paths, Huffman coding, and fractional knapsack. Divide and ...

13:11
algorithmic paradigms

28 views

5 days ago

Jackie Wang
[HD] EECS3101 S26 - 2026-06-30 (Tuesday) - Lecture 16

All study resources (iPad notes, slides, written notes) are available here: ...

1:15:01
[HD] EECS3101 S26 - 2026-06-30 (Tuesday) - Lecture 16

10 views

1 day ago

Institute of Aeronautical Engineering
Adjacency Matrix by Dr. D Sreelakshmi

Adjacency Matrix by Dr. D Sreelakshmi | IARE | #AdjacencyMatrix #GraphTheory #GraphRepresentation #DataStructures ...

12:38
Adjacency Matrix by Dr. D Sreelakshmi

5 views

1 day ago

Kelas A Matematika'23
Teknik Riset Operasi - Video Penjelasan Pohon Rentang Minimal MST
18:43
Teknik Riset Operasi - Video Penjelasan Pohon Rentang Minimal MST

9 views

6 days ago

北大人
【讲座回放】王琛博士:度量空间中具有强弱距离预言机的聚类和最小生成树问题 - PKU 北大人

欢迎来到北大人频道!我们专注于分享关于北京大学的校友故事、校园生活和校园发展。北京大学位于中国的首都北京,是一所历史 ...

1:01:16
【讲座回放】王琛博士:度量空间中具有强弱距离预言机的聚类和最小生成树问题 - PKU 北大人

5 views

5 days ago