graph-algorithms

Select a graph algorithm by framing your domain problem explicitly, comparing candidate algorithms with their trade-offs, and validating the choice against your specific optimization or planning requirements.

Choose an adjacency list for large-scale graphs with sparse operations, and an adjacency matrix when you need dense connectivity checks and constant-time edge lookups during graph modeling.

Compare graph algorithms for dependency analysis by evaluating explicit trade-offs, validation plans, and reasoning against your specific reachability, shortest path, and connectivity requirements.

Validate a graph algorithm by applying the structured workflow to create validation plans and documentation artifacts that prove correctness for your specific flow or connectivity scenario.

Yes, this workflow supports both directed and undirected graph problems by determining appropriate representations and algorithms based on your specific scale and required operations.

Required documentation artifacts include explicit problem framing, algorithm comparison details, selection rules, validation plans, and reasoning justifying the chosen graph representation for correctness and performance.