Extension and application of POJ 1388 Hinge Node problem Floyd algorithm

POJ 1388
//sep9
#include <iostream>
using namespace std;
const int maxn=128;
Char S[MAXN][MAXN];
int G[MAXN][MAXN];
int HINGE[MAXN][MAXN];
int VIS[MAXN];
int main ()
{
	int n;
	while (scanf ("%d", &n) ==1&&n) {
		memset (hinge,0,sizeof (hinge));
		for (int i=1;i<=n;++i)
			scanf ("%s", S[i]);
		for (int. i=1;i<=n;++i) for
			(int j=1;j<=n;++j)
				g[i][j]=s[i][j-1]-' 0 ';
		for (int k=1;k<=n;++k) for (int
			i=1;i<=n;++i) for
				(int j=1;j<=n;++j)
					if (g[i][k]&&g[k ][j]) {
						if (g[i][j]==0| | G[I][K]+G[K][J]<G[I][J])
							hinge[i][j]=k,g[i][j]=g[i][k]+g[k][j];
						else if (G[i][k]+g[k][j]==g[i][j])
							hinge[i][j]=0;
					}					
		memset (vis,0,sizeof (Vis));
		for (int i=1;i<=n;++i) for
			(int j=i+1;j<=n;++j)
				vis[hinge[i][j]]=1;
		int ans=0;
		for (int i=1;i<=n;++i)
			ans+=vis[i];
		printf ("%d\n", ans);
	}
	return 0;	
}