Add Bridge Detection Algorithm (Tarjan's Method) in R

[iampratik13]

This PR introduces a complete implementation of the Bridge Detection Algorithm (also known as critical edge detection) in R using Tarjan’s algorithm. The algorithm identifies all edges in an undirected graph whose removal increases the number of connected components. These edges are also referred to as bridges.

Algorithm Complexity:
• Time Complexity: O(V + E) — DFS traversal over all vertices and edges
• Space Complexity: O(V) — arrays for visited, discovery, low-link, and parent information

Use Cases:
• Network reliability analysis (finding critical connections)
• Graph connectivity analysis
• Educational demonstrations for graph algorithms in R

File added: bridge_detector.r

[Copilot]

Pull Request Overview

This PR introduces a bridge detection algorithm implementation using Tarjan's method to identify critical edges in undirected graphs. The algorithm finds edges whose removal would increase the number of connected components in the graph.

• Implements Tarjan's bridge detection algorithm with O(V + E) time complexity
• Provides comprehensive examples demonstrating various graph topologies
• Includes edge case handling for empty graphs and disconnected components

[siriak]

Looks good, thanks!