情境
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.