Cache graph traversal and routing for inference (#281)

Precompute DAG traversal, in/out degrees, and per-layer edge routing
after graph mutations instead of rebuilding them on every inference.

Replace hash-based branch tracking with dense layer-id indexed state and
cached input bindings, preserving the existing tensor flow while
removing repeated topology scans from the execution path.

Author: aobolensk