Algoritmo di Kosaraju-Sharir
algorithm to find the strongly connected component of a directed graph
algorithm to find the strongly connected component of a directed graph
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).