Tarjan's strongly connected components algorithm
Graph theory algorithm
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm.
Nº Q1972285 ★
Común · Saberes
Tarjan's strongly connected components algorithm
Graph theory algorithm
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm.
Último precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
Historial de ventas
- Última venta
- —
- Media 30 d
- —
- Mínimo 30 d
- —
- Máximo 30 d
- —
- Ventas 7 d
- 0
- Ventas 30 d
- 0
Aún no hay ventas.
Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm. The algorithm is named for its inventor, Robert Tarjan.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: LynX (CC BY-SA 3.0) ·
Cartas cercanas
Exponenciación binaria
Nº Q864127 ★★
Algoritmo de Dijkstra
Algoritmo para determinar el camino más corto corto en un grafo con pesos en cada arista
Nº Q8548 ★★★★
Algoritmo de Strassen
Nº Q728507 ★★
Algoritmo de Kruskal
Nº Q797860 ★★
Problema de la suma de subconjuntos
Nº Q1154420 ★★
Algoritmo de Prim
Nº Q470813 ★★