View Tube

Finding minimum arborescence on directed graph.

7:32

4.mov

740 views

14 years ago

MinimumArborescenceExample

minimum arborescence on a directed graph.

6:26

10,527 views

14 years ago

Algoritmo de Borůvka (Algoritmo de Sollin) para grafos.

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

117 views

3 years ago

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

4:45

kdTree2.mov

14,749 views

14 years ago

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

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

9:03

MaximumFlow2.mov

6,267 views

14 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

1,135 views

3 years ago

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

11,626 views

14 years ago

Minimum weight spanning tree: Prim's algorithm

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

196,148 views

8 years ago

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

116 views

2 years ago

PassItEDU

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,927 views

11 years ago

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

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

64,336 views

5 years ago

The most well-known complexities in computer science

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

318,355 views

8 years ago

Salle 212

The most well-known complexities in computer science

New video, a follow-up to the video on complexity. Here, I discuss the most well-known complexities and try to provide a ...

15:27

2,847 views

6 years ago

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

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

271,185 views

8 years ago

Algorithme de Kruskal pour construire un arbre couvrant de poids minimal

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

164,919 views

7 years ago

edyo.ru

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

5:15

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

2,307 views

9 years ago

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

1,045 views

3 years ago