[NEW ALGORITHM] Gabow's Algorithm for Strongly Connected Components

[sandeepmaddheshiya]

Name:

Gabow's Algorithm

About:

We propose implementing Gabow's Algorithm for finding Strongly Connected Components (SCC) in a directed graph. This algorithm is a lesser-known but highly efficient alternative to Tarjan's Algorithm. Gabow’s approach uses two stacks to track nodes and efficiently determines SCCs, offering performance advantages in certain cases, particularly when graphs have dense structures or specific connectivity properties. Its runtime complexity remains O(V + E), where V is the number of vertices and E is the number of edges, matching the complexity of Tarjan's algorithm.

This feature will provide a faster solution for SCC detection in graphs where Tarjan's algorithm may not perform as efficiently due to practical constraints.

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Contributor in Hactoberfest
• Want to work on it

[sandeepmaddheshiya]

@pankaj-bind please assign to me, i'll do it asap!

[pankaj-bind]

@sandeepmaddheshiya assigned

[sandeepmaddheshiya]

@pankaj-bind I've created a PR please review it.
Thanks!