# Computational Graph Deep Dive: DAG Structure, Topological Sort, Eager vs Static Paradigm

> Source: https://sukruyusufkaya.com/en/learn/llm-muhendisligi/computational-graph-dag-topological-eager-static
> Updated: 2026-05-13T13:00:23.633Z
> Category: LLM Mühendisliği
> Module: Module 2: Before PyTorch — NumPy and Autodiff from Scratch
**TLDR:** Deep analysis of the graph structure behind autograd: DAG anatomy, in-degree/out-degree, topological sort algorithms (DFS post-order, Kahn's), eager (PyTorch) vs static (TF1, JAX, XLA) paradigms, graph optimization (fusion, dead code elimination).