Add Dinic maximum flow with per-edge flows

[f-gueguen]

Summary

• Implement Dinic's algorithm for maximum flow with residual graph and per-edge flow extraction
• Expose API and types in docs and index; add example and tests
• Check off roadmap max-flow entry

Testing

• npm run lint
• npm run typecheck
• npm test
• npm run build