1 - 1 / 1 1 |
1. Algorithms for finding the strongly connected components of directed graphs INA LANG, 2021, undergraduate thesis Keywords: graph, strong connectivity, strongly connected, Tarjan’s algorithm, Kosaraju’s algorithm, Gabow, path-based, Blelloch, Fleischer, parallelism. |