最終更新日：2024/07/30
(graph theory) Given a directed graph, a maximal strongly connected subgraph.
正解を見る
strongly connected component
編集履歴（0）
(graph theory) Given a directed graph, a maximal strongly connected subgraph.
strongly connected component
DiQt（ディクト）
無料
★★★★★★★★★★
