ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

22 results

Wanderley de Souza Alencar
Algoritmo de Borůvka (Algoritmo de Sollin) para grafos.

Videoaula que aborda o algoritmo Borůvka (ou Algoritmo de Sollin). Ele é capaz de identificar uma árvore geradora mínima em ...

19:51
Algoritmo de Borůvka (Algoritmo de Sollin) para grafos.

117 views

3 years ago

Dr. Zdenek Moravcik, inventor of AGI
Borůvkův algoritmus

Borůvkův algoritmus hledá nejkratší propojení všech uzlů v síti. Otakar Borůvka byl matematik z Brna a svůj algoritmus vytvořil již v ...

8:46
Borůvkův algoritmus

530 views

1 year ago

À la découverte des graphes
Minimum weight spanning tree: Prim's algorithm

Description of Prim's algorithm which (easily) constructs a minimum weight spanning tree of a weighted (connected) graph.

8:23
Minimum weight spanning tree: Prim's algorithm

194,404 views

8 years ago

Susan Haynes
MinimumArborescenceExample

minimum arborescence on a directed graph.

6:26
MinimumArborescenceExample

10,502 views

14 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,798 views

5 years ago

Susan Haynes
4.mov

Finding minimum arborescence on directed graph.

7:32
4.mov

740 views

14 years ago

PassItEDU
Discrete Mathematics - Prim's Algorithm

Questions forum: http://passitedu.foroactivo.com/t121-algoritmo-de-prim#206 Remember: Website: http://www.passitedu.es ...

14:41
Discrete Mathematics - Prim's Algorithm

59,877 views

11 years ago

Susan Haynes
kdTree2.mov

Using the same data as for kdTree1.mov, showing how the nodes successively partition the 2D space.

4:45
kdTree2.mov

14,748 views

14 years ago

À la découverte des graphes
Algorithme de Kruskal pour construire un arbre couvrant de poids minimal

Description de l'algorithme de Kruskal qui prend en entrée un graphe connexe pondéré et construit/extrait un arbre couvrant de ...

8:32
Algorithme de Kruskal pour construire un arbre couvrant de poids minimal

163,348 views

7 years ago

Kamil Nizam Mansor
reverse delete algorithm

Reverse Delete Algorithm is one of greedy algorithm technique. This video is part of my study on Data Structure and Algorithm ...

5:32
reverse delete algorithm

8,540 views

13 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

Susan Haynes
MaximumFlow2.mov

Computing maximum flow, example 1. Clip 2 out of 2.

9:03
MaximumFlow2.mov

6,266 views

14 years ago

Susan Haynes
CirculationWithDemands1.mov

Network flow. An example demonstrating how to compute circulation with demands at nodes (i.e., one or more nodes supply traffic ...

9:57
CirculationWithDemands1.mov

11,611 views

14 years ago

Joseph S. Alcântara
Algoritmo de Prim

Implementação do Algoritmo de Prim para criação de Árvore Geradora Mínima.

12:29
Algoritmo de Prim

4,816 views

14 years ago

À la découverte des graphes
Flows 2: The Ford-Fulkerson algorithm for constructing a max flow in a graph

The main steps of the Ford-Fulkerson algorithm for constructing a maximum value stream. Continuation of the video "Stream 1".

11:16
Flows 2: The Ford-Fulkerson algorithm for constructing a max flow in a graph

268,562 views

7 years ago

Wanderley de Souza Alencar
Algoritmo Reverse-Delete (grafos)

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

11:20
Algoritmo Reverse-Delete (grafos)

116 views

2 years ago

À la découverte des graphes
Dijkstra's algorithm

Dijkstra's algorithm for calculating distances from a vertex in a weighted graph. This video illustrates the main steps on a ...

9:00
Dijkstra's algorithm

316,107 views

8 years ago

Karsten Morisse
aud 9 3 Algorithmus von Prim (Minimaler Spannbaum)

Algorithmus von Prim als Spezialfall des Färbungsalgorithmus von Tarjan (https://youtu.be/BsMKIEYgSEU)

4:06
aud 9 3 Algorithmus von Prim (Minimaler Spannbaum)

7,872 views

8 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

edyo.ru
Теория сетей: 7. Связность

Седьмая лекция курса "Теория сетей" от Complexity Academy. Одним из определяющих свойств сети становится её общая ...

5:15
Теория сетей: 7. Связность

2,306 views

9 years ago