ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

183 results

The Palindrome
The Single Most Undervalued Fact of Linear Algebra

0:00 - Matrices are graphs 1:24 - The connectivity of directed graphs 2:40 - Connectivity and matrix structure 4:26 - Reducible and ...

13:04
The Single Most Undervalued Fact of Linear Algebra

31,861 views

4 days ago

Dr. Maryam Miradi
You Can Build Graph-Powered Road AI Agents in 18 Min: Graph Engineering for Production AI Agents

You'll see: • Raw network data → engineered graph • Nodes, edges, weights and directed graphs • Shortest paths and ...

18:02
You Can Build Graph-Powered Road AI Agents in 18 Min: Graph Engineering for Production AI Agents

7,581 views

5 days ago

Graph Garden
Bellman-Ford Algorithm — Visualized in 10 Minutes

What happens to shortest paths when edge weights can be negative? Dijkstra's algorithm silently gives the wrong answer — and ...

9:52
Bellman-Ford Algorithm — Visualized in 10 Minutes

6 views

5 days ago

IIT Roorkee July 2018
Lecture 36: Introduction to Graph Theory

In this lecture, I will begin with the idea that every flowsheet is a graph in abstract form. I will present basic concepts of graph ...

37:22
Lecture 36: Introduction to Graph Theory

15 views

1 day ago

Neural Lantern
How to Represent an Unweighted Undirected Graph with an Edge List

This is the first in a series covering all four combinations of weighted and directed graphs with edge lists. 00:00 Introduction to ...

22:35
How to Represent an Unweighted Undirected Graph with an Edge List

8 views

6 days ago

Partners DSA
Longest Path in a Directed Acyclic Graph - Bellman Ford Algorithm

Given a weighted Directed Acyclic Graph (DAG) with V vertices numbered from 0 to V - 1, represented by edges[][], where edges[i] ...

13:31
Longest Path in a Directed Acyclic Graph - Bellman Ford Algorithm

4 views

4 days ago

Vector Meridian
AI-Integrated Chips: The Architecture Between Token and Answer

AI chips are not magic silicon. They are bets about where the bottleneck lives: compute, memory, communication, or control.

30:40
AI-Integrated Chips: The Architecture Between Token and Answer

51 views

5 days ago

Python Italia
Graph theory and NetworkX 101 – doing stuff with data is more than just machine learning

Graph theory and NetworkX 101 – doing stuff with data is more than just machine learning - Silva Bashllari - PyCon Italia 2026 ...

27:46
Graph theory and NetworkX 101 – doing stuff with data is more than just machine learning

19 views

5 days ago

Glass Box Computing
Graphs: Terminology, Connectivity, Euler & Hamiltonian Paths — Discrete Mathematics | 10

5:21 Directed Graphs 6:57 A Simple Directed Graph 8:53 Graph Models: a Multigraph 10:23 Three Questions That Fix the Graph ...

2:03:15
Graphs: Terminology, Connectivity, Euler & Hamiltonian Paths — Discrete Mathematics | 10

11 views

6 days ago

Glass Box Computing
Graph Traversal: Lab Exercises — Data Structures in C | 15.13

... Challenge: cycle detection in a directed graph (~30 min) 6:14 Lab 3 — Solution: the recursive worker 7:19 Lab 3 — Solution: the ...

8:21
Graph Traversal: Lab Exercises — Data Structures in C | 15.13

0 views

1 day ago

DIMACS CCICADA
DAG Covers: A Survey

A DAG cover of a general directed graph G is a small collection of DAGs so that for all pairs of vertices s,t in G, some DAG in the ...

50:22
DAG Covers: A Survey

21 views

10 hours ago

Glass Box Computing
What Is a Graph? — Data Structures in C | 14.2

A plain, precise definition of a graph — and the one idea everything else follows from. We define it exactly, picture it, and pull out ...

10:11
What Is a Graph? — Data Structures in C | 14.2

0 views

1 day ago

Txevron
Loop Engineering is Dead, Graph Engineering is Here

Stop building infinite while loops that burn your API credits and crash your production databases. In this video, we break down ...

6:20
Loop Engineering is Dead, Graph Engineering is Here

71 views

4 days ago

3cycle and Ben Rosenberg
Linear Programming - Flow, paths, and more in polynomial time!

In this talk, we discuss: - Why convex optimization is useful - What linear programming is (not related to writing code!) - Some ...

1:32:31
Linear Programming - Flow, paths, and more in polynomial time!

1,117 views

5 days ago

ExamPrepTool
Discrete Mathematics Graph Theory Lecture-5 | Graph Theory Complete Course | GATE 2027

GATE 2027 Discrete Mathematics Graph Theory Lecture-5 covers important Graph Theory concepts for GATE CSE and GATE DA ...

1:05:44
Discrete Mathematics Graph Theory Lecture-5 | Graph Theory Complete Course | GATE 2027

97 views

Streamed 7 days ago

NPTEL TA Lectures
Week 6 NPTEL TA Session DAA [noc26-cs110]
2:13:10
Week 6 NPTEL TA Session DAA [noc26-cs110]

38 views

6 days ago

Álgebra lineal. Montessori. Trucos cartas.
Solitario búlgaro a través de digrafos. Vídeo 5 bis

Siguiendo a Suzanne Dorée y mostrando partes de su artículo didáctico "Bulgarian Solitaire" (2009) (véase la Referencia al final), ...

18:48
Solitario búlgaro a través de digrafos. Vídeo 5 bis

11 views

5 days ago

SCIENCE IN FRONT OF YOU
Topological Sort Using Kahn's Algorithm | GFG Solution in C++ | BFS Approach Explained

Problem Statement: Given a Directed Acyclic Graph with V vertices and E directed edges, find a valid topological ordering of all ...

1:07
Topological Sort Using Kahn's Algorithm | GFG Solution in C++ | BFS Approach Explained

8 views

3 days ago

Elshimi Explains
Why Free-Roaming AI Agents Are Dead (And How DAGs Save Production)?

Why do autonomous AI agents fail when they leave the sandbox? In 2026, engineering teams are learning that free-roaming ...

5:33
Why Free-Roaming AI Agents Are Dead (And How DAGs Save Production)?

1 view

4 days ago

Bellam DeepTech Strategy & Research Institute
AI Decodes The Evolution of AI Stack

Causal masking as a triangular directed graph. Multimodality through tokenization. Inductive bias against data scale. A minimal ...

8:47
AI Decodes The Evolution of AI Stack

3 views

3 days ago