⚡ Perf: Optimize broken link calculation in metrics

[saurabhsharma2u]

💡 What: Replaced an O(N*E) array filtering operation with an O(N+E) adjacency list lookup when calculating brokenLinks for each node in calculateMetrics.
🎯 Why: The previous implementation iterated over all edges for every node to find its outgoing edges. This became a significant performance bottleneck on large graphs with many nodes and edges. By pre-computing a map of node URLs to their outgoing edge targets, we drastically reduce the time complexity.
📊 Measured Improvement: Added a performance benchmark test (tests/metrics.test.ts) that creates a synthetic graph with 5,000 nodes and 50,000 edges.

• Baseline: ~6,142ms
• After Optimization: ~77ms
• Improvement: ~80x faster (98.7% reduction in execution time).

---

PR created automatically by Jules for task 16670329511532797524 started by @saurabhsharma2u

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.