Added Tarjan's algorithm (bridges) to CPP/algorithms/graph_algorithms

[Abdullah-Shah-26]

/*

• Algorithm: Tarjan’s Algorithm for Bridge Detection
• Problem
• Given an undirected graph, find all bridges (critical edges)
• whose removal increases the number of connected components.
• Approach
• • DFS traversal tracking discovery times (disc) and low-link values (low)
• • For each edge (u, v), if low[v] > disc[u], it is a bridge
• • Supports multiple connected components
• Complexity
• • Time: O(V + E) – each vertex and edge visited once
• • Space: O(V + E) – adjacency list, arrays, recursion stack
• Input
• • Number of vertices (V)
• • List of edges {u, v}
• Output
• • List of all bridges in the graph
• Additional
• • Includes inline visualization in comments for clarity
    */

[github-actions]

🎉 Welcome to Hacktoberfest 2025, @Abdullah-Shah-26! 🎃

Thank you for your first contribution to our DSA repository! Here's what happens next:

🔍 Automatic Checks

• ✅ Code Validation: Passed
• 🧪 Compilation Tests: Passed

📋 Next Steps

🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon.

🎁 What You Get

• 🏆 Hacktoberfest Credit: This PR counts toward your 6 PR goal for exclusive T-shirt + Tree!
• 🌟 Hall of Fame: You'll be featured in our contributors list
• 📚 Learning: Code review feedback from experienced developers

💡 Tips for Success

• Follow our Contributing Guidelines
• Add comments explaining your algorithm
• Include time/space complexity analysis
• Test your code before submitting

Welcome to the community! 🚀

[github-actions]

🤖 Automated PR Status

🔍 Code Validation

✅ Passed - File naming and structure look good!

🧪 Compilation Tests

✅ Passed - All code compiles successfully!

📋 Overall Status

🎉 Ready for Review - Your PR has passed all automated checks!
👥 Maintainers have been notified for review.

---

This comment was generated automatically. Checks will re-run when you push new commits.

[Karanjot786]

@Pradeepsingh61 merge it