Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
19 results
Videoaula que aborda o algoritmo Borůvka (ou Algoritmo de Sollin). Ele é capaz de identificar uma árvore geradora mínima em ...
117 views
3 years ago
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 ...
544 views
1 year ago
Description of Prim's algorithm which (easily) constructs a minimum weight spanning tree of a weighted (connected) graph.
194,974 views
8 years ago
minimum arborescence on a directed graph.
10,508 views
14 years ago
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, ...
63,971 views
5 years ago
Description de l'algorithme de Kruskal qui prend en entrée un graphe connexe pondéré et construit/extrait un arbre couvrant de ...
163,892 views
7 years ago
Finding minimum arborescence on directed graph.
740 views
Using the same data as for kdTree1.mov, showing how the nodes successively partition the 2D space.
14,749 views
Questions forum: http://passitedu.foroactivo.com/t121-algoritmo-de-prim#206 Remember: Website: http://www.passitedu.es ...
59,889 views
11 years ago
We sketch Kosaraju's algorithm to finds the strong components of a digraph in linear time. We also define bipartite graphs and ...
1,135 views
Computing maximum flow, example 1. Clip 2 out of 2.
6,267 views
Network flow. An example demonstrating how to compute circulation with demands at nodes (i.e., one or more nodes supply traffic ...
11,620 views
The main steps of the Ford-Fulkerson algorithm for constructing a maximum value stream. Continuation of the video "Stream 1".
269,545 views
Este vídeo foi produzido como requisito parcial de atividade acadêmica [Atividade Supervisionada nº 02] realizada no transcorrer ...
116 views
2 years ago
Dijkstra's algorithm for calculating distances from a vertex in a weighted graph. This video illustrates the main steps on a ...
316,855 views
Videoaula que aborda o algoritmo de Kosaraju-Sharir para grafos (identifica os componentes fortemente conexos de um grafo ...
1,457 views
Videoaula que aborda o algoritmo de Floyd-Warshall para grafos. Este algoritmo tem por objetivo é encontrar o caminho mais ...
1,045 views
Sobre o algoritmo de programação dinâmica e sua análise de tempo.
1,408 views
Седьмая лекция курса "Теория сетей" от Complexity Academy. Одним из определяющих свойств сети становится её общая ...
2,306 views
9 years ago
