Added a program to compute the vertex connectivity of (multi)graphs
Corrected comments
Use unsigned long long instead of int to count the number of graphs read.
Prevent the unnecessary decoding of graphs.

This can speed up the program significantly.
Prevent the unnecessary decoding of graphs.

This can speed up the program significantly.
Use unsigned long long int to count the number of graphs instead of int.