Finding strong components using depth-first search

arxiv（2023）

引用 0|浏览21

暂无评分

摘要

We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan’s algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.

查看译文

关键词

strong components,search,depth-first

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要