상황
Design a UML class diagram for Tarjan's Strongly Connected Components algorithm, focusing on the recursive DFS traversal, vertex bookkeeping, and graph ownership.
이 도면에 담긴 내용
그 이면의 의사결정을 읽어 보세요.
01
Abstract SCCAlgorithm base class generalizes the SCC interface.
02
TarjanSCC orchestrates traversal and owns the working stack.
03
Graph composes vertices and edges, while Edge references its endpoints.
Useful for implementing, explaining, or extending Tarjan's SCC algorithm in graph libraries, algorithm courses, or technical documentation.