BRUTE FORCE

For comparison purposes, I have developed a brute force implementation of solving the vertex connectivity problem.

First of all here are some of the definitions of the notations i used:

G – The Graph
n – Total number of vertices
N – Set of all vertices in G
C – Subset of N

And Now Heres the Brute Force algorithm:
1. Test G for connectivity
2. Find articulation points if G is connected
3. Vertex Connectivity is 1 when an articulation point is preset
4. Otherwise generate all combination C of subset N taken k at a time where k = 2 to n-1.
5. For all C…Delete C from N and test for connectivity
6. Stop when G is disconnected or k = n – 1
7. Vertex Connectivity = k when G is disconnected or n – 1 when k reaches n - 1