Image by Ogutier on Pixabay · Pixabay License
algorithme de Kosaraju
Sign in to savealgorithm to find the strongly connected component of a directed graph
In the Vinony graph
Within Vinony's link graph, algorithme de Kosaraju is referenced by 12 other articles, and connects out to computer science, International Standard Book Number and algorithm.
It is catalogued under topics including Graph algorithms and Graph connectivity.
Its subject is documented across 11 Wikipedia language editions.
Wikidata facts
- Based on
- depth-first search
Show 2 more facts
- product or material produced
- strongly connected component
- facet of
- strongly connected component
Sources (1)
via Wikidata · CC0
Article · Français
En informatique, l'algorithme de Kosaraju est un algorithme de calcul des composantes fortement connexes d'un graphe orienté. Il effectue deux parcours en profondeur et a une complexité linéaire en la taille du graphe.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
computer science
Entity
International Standard Book Number
Entity
algorithm
Entity
digital object identifier
Entity
data structure
Entity
complement
Entity
depth-first search
Entity
breadth-first search
Entity
Alfred Aho
Entity
adjacency matrix
Entity
directed graph
Entity
time complexity
Entity
John Edward Hopcroft
Entity
Jeffrey David Ullman
Entity
strongly connected component
Entity
adjacency list
Entity
tree traversal
Entity
Tarjan's strongly connected components algorithm
Entity
transpose graph
Entity
graph operation
Entity