ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

20 results

Roel Van de Paar
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)? (2 Solutions!!)

How does Tarjan's pseudocode work (explained to someone familiar with C or Java)? Helpful? Please support me on Patreon: ...

4:09
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)? (2 Solutions!!)

1 view

4 years ago

David Welch
AofA Lecture 27: Kosaraju's algorithm for finding strong components, and bipartite graphs

We sketch Kosaraju's algorithm to finds the strong components of a digraph in linear time. We also define bipartite graphs and ...

15:17
AofA Lecture 27: Kosaraju's algorithm for finding strong components, and bipartite graphs

1,135 views

3 years ago

Wanderley de Souza Alencar
Algoritmo de Tarjan para grafos

Este vídeo foi produzido como requisito parcial de atividade acadêmica [Atividade Supervisionada nº 02] realizada no transcorrer ...

16:21
Algoritmo de Tarjan para grafos

320 views

2 years ago

Wanderley de Souza Alencar
Algoritmo de Tarjan para grafos.

Videoaula que aborda o algoritmo de Tarjan para grafos, proposto na década de 1980 por Robert Tarjan e que tem como ...

10:03
Algoritmo de Tarjan para grafos.

1,172 views

3 years ago

caranha
プログラミングチャレンジ W05P03 Tarjan法
13:27
プログラミングチャレンジ W05P03 Tarjan法

29 views

4 years ago

À la découverte des graphes
Algorithme pour les composantes fortement connexes d'un graphe orienté.

Description (ni formelle ni complète) sur un exemple d'un algorithme permettant de trouver les composantes fortement connexes ...

16:26
Algorithme pour les composantes fortement connexes d'un graphe orienté.

63,556 views

5 years ago

Roel Van de Paar
Finding the size of the largest connected component in a graph (2 Solutions!!)

Finding the size of the largest connected component in a graph Helpful? Please support me on Patreon: ...

4:05
Finding the size of the largest connected component in a graph (2 Solutions!!)

83 views

3 years ago

À la découverte des graphes
Composantes fortement connexes d'un graphe orienté : c'est quoi ?

La notion de connexité dans les graphes est très importante. Après un bref rappel de ce que c'est dans les graphes non orientés, ...

6:23
Composantes fortement connexes d'un graphe orienté : c'est quoi ?

63,948 views

5 years ago

WIT Solapur - Professional Learning Community
Finding Single Shortest Path using Dijkestra's Algorithm

Mr. V. R. Tribhuvan, Assistant Professor, Computer Science and Engineering Department, Walchand Institute of Technology, ...

12:27
Finding Single Shortest Path using Dijkestra's Algorithm

465 views

7 years ago

!!Con
!!Con West 2020 - Vaibhav Sagar: Compilers for nothing, executables for free!

Presented at !!Con West 2020: http://bangbangcon.com/west I'm going to talk about a less commonly known, but surprisingly ...

9:05
!!Con West 2020 - Vaibhav Sagar: Compilers for nothing, executables for free!

423 views

5 years ago

Karsten Morisse
AuD18 28 Minimum Spanning Tree (Algorithm Prim)

Berechnung eines Minimalen Spannbaumes mit dem Algorithmus von Prim (als Spezialfall des generischen Algorithmus von ...

9:03
AuD18 28 Minimum Spanning Tree (Algorithm Prim)

1,042 views

6 years ago

Wanderley de Souza Alencar
Videoaula do algoritmo de Kosaraju-Sharir para grafos

Videoaula que aborda o algoritmo de Kosaraju-Sharir para grafos (identifica os componentes fortemente conexos de um grafo ...

13:00
Videoaula do algoritmo de Kosaraju-Sharir para grafos

1,457 views

3 years ago

Wanderley de Souza Alencar
Algoritmo de Fleury em grafos.

Videoaula que aborda o algoritmo de Henri Fleury para grafos (identificação de ciclos Eurelianos em grafos). A videoaula foi ...

13:55
Algoritmo de Fleury em grafos.

493 views

3 years ago

Akhil Kokani
Writing a Program to detect and identify tautologies for given values in Python - Akhil Kokani

I've been learning Discrete Mathematics recently, while I was learning, I found out interesting topics called as tautology, and ...

8:21
Writing a Program to detect and identify tautologies for given values in Python - Akhil Kokani

677 views

7 years ago

Roel Van de Paar
Code Review: Counting sort using STL (2 Solutions!!)

Code Review: Counting sort using STL Helpful? Please support me on Patreon: https://www.patreon.com/roelvandepaar With ...

4:30
Code Review: Counting sort using STL (2 Solutions!!)

4 views

3 years ago

Wanderley de Souza Alencar
Algoritmo Kosaraju (grafos)

Este vídeo foi produzido como requisito parcial de atividade acadêmica [Atividade Supervisionada nº 02] realizada no transcorrer ...

12:47
Algoritmo Kosaraju (grafos)

391 views

2 years ago

宇宙のすべての知識 プリンシピア
Donald Knuth

Donald Knuth, by Wikipedia https://en.wikipedia.org/wiki?curid=8095 / CC BY SA 3.0 #Donald_Knuth ...

12:28
Donald Knuth

21 views

6 years ago

Karsten Morisse
AuD18 27 Minimum Spanning Tree (Algorithm  Kruskal)

Berechnung eines Minimalen Spannbaumes mit dem Algorithmus von Kruskal (als Spezialfall des generischen Algorithmus von ...

11:20
AuD18 27 Minimum Spanning Tree (Algorithm Kruskal)

839 views

6 years ago

Wanderley de Souza Alencar
Algoritmo de Floyd-Warshall para grafos.

Videoaula que aborda o algoritmo de Floyd-Warshall para grafos. Este algoritmo tem por objetivo é encontrar o caminho mais ...

14:03
Algoritmo de Floyd-Warshall para grafos.

1,045 views

3 years ago

Wanderley de Souza Alencar
Algoritmo de Kahn para grafos

Este vídeo foi produzido como requisito parcial de atividade acadêmica [Atividade Supervisionada nº 02] realizada no transcorrer ...

9:00
Algoritmo de Kahn para grafos

506 views

2 years ago