⚡ Bolt: Optimize SequenceMatcher loop in graph.py

[kourdroid]

💡 What: The difflib.SequenceMatcher initialization was moved outside the loop in _node_fingerprint_and_lookup. The set_seq2() method is now used to update the comparison string on each iteration, and matcher.quick_ratio() is used to quickly discard poor matches.

🎯 Why: Creating a new SequenceMatcher object on every iteration recalculates expensive internal caches for the static sanitized_current string. The ratio() method is also computationally heavy (up to O(N^2)). Using quick_ratio() (O(N)) first allows us to skip ratio() entirely for poor candidates, dramatically speeding up the lookup step when dealing with large schema registries.

📊 Impact: Reduces time spent in the schema lookup loop significantly, especially as the number of schemas in the registry grows.

🔬 Measurement: Verify by running the full test suite (pytest) and checking the execution time of the fingerprint_and_lookup step for payloads against a large registry.

---

PR created automatically by Jules for task 15746250650138011442 started by @kourdroid

[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.