Stoer wagner min cut

[ArpitaHanjagi]

Algorithm: Stoer–Wagner Minimum Cut

Purpose: Finds the global minimum cut in an undirected weighted graph.

Theory: Repeatedly merges vertices while tracking the most tightly connected set, updating the minimum cut value.

Time Complexity: O(V³) for standard adjacency matrix implementation.

Space Complexity: O(V²) for adjacency matrix.

Input: Undirected weighted graph as an adjacency matrix or list.

Output: Minimum cut value and a representative vertex of the cut.

[github-actions[bot]]

This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

[github-actions[bot]]

This PR was closed because it has been stalled for 7 days with no activity.