상황
A software team needs to document the object-oriented design of a topological sort library that supports multiple graph traversal strategies and detects cycles in directed graphs.
이 도면에 담긴 내용
그 이면의 의사결정을 읽어 보세요.
01
Modeled the sorting strategy as an interface with Kahn's and DFS as interchangeable implementations
02
Composed Graph from Vertex and DirectedEdge with multiplicity to enforce graph invariants
03
Included CycleDetector as a dependency for algorithms that need cycle validation
Use this diagram when designing or documenting graph algorithm libraries, educational materials on topological sorting, or dependency resolution systems that operate on directed acyclic graphs.