Home›Graph algorithms›ขั้นตอนวิธีของโกสรชุ🌐ไทยEnglishEspañolFrançaisItalianoTiếng ViệtРусскийفارسیไทย한국어中文EntityQ2655281· pop 11· linked from 12 articlesขั้นตอนวิธีของโกสรชุalgorithm to find the strongly connected component of a directed graphAvailable in 11 languagesFrançais中文РусскийItalianoHungarianTiếng ViệtUkrainianفارسیไทย한국어Connectionscomputer scienceEntityInternational Standard Book NumberEntityCategoriesGraph algorithmsGraph connectivity