Kosaraju's algorithm
algorithm to find the strongly connected component of a directed graph
Facts
6 properties- Instance of
- algorithm, graph algorithm[1]
- Based on
- depth-first search[3]
- Facet of
- strongly connected component[5]
- Named after
- S. Rao Kosaraju[2]
- Product or material produced
- strongly connected component[4]
- Worst-case time complexity
- O({|V|}^2), \Theta(|V|+|E|)
🏷️ Also known as
en Kosaraju's algorithm
es algoritmo de Kosaraju
fa الگوریتم کساراجو
fr algorithme de Kosaraju
hu Kosaraju-algoritmus
it Algoritmo di Kosaraju-Sharir
ko 코사라주의 알고리즘
ru Алгоритм Косарайю
th ขั้นตอนวิธีของโกสรชุ
th อัลกอริทึมของ Kosaraju
uk Алгоритм Косараджу
vi Thuật toán Kosaraju
zh Kosaraju算法
zh-hant Kosaraju演算法
🔗 Connections
Based on 1
Facet of 1
Instance of 1
Named after 1
Product or material produced 1
Press Enter · cited answer in seconds