From yandong Thu May  2 14:28:12 1996
Received: from sbgrad9.csdept (sbgrad9.cs.sunysb.edu [130.245.2.29]) by cs.sunysb.edu (8.6.12/8.6.9) with SMTP id OAA06684 for <skiena>; Thu, 2 May 1996 14:28:12 -0400
Date: Thu, 2 May 1996 14:28:12 -0400
From: Yan Dong <yandong>
Message-Id: <199605021828.OAA06684@cs.sunysb.edu>
To: skiena
Subject: verify.cc
Status: RO



//This program provides a way to verify that the graph-edge-coloring
//program is correct!


#include <iostream.h>

enum Boolean {FALSE=0, TRUE=1};


Boolean Verify()
{

    int v, e;
    cin >> v;
    cin >> e;

    int A[e], B[e], color[e];

    for (int i=0; i<e; i++) 
	cin >> A[i] >> B[i] >> color[i];





    for (int j=0; j<e; j++) 
	for (int k=0; k<e; k++) {
	    if (A[j]==A[k] && B[j]!=B[k] && color[j] == color[k])
		return FALSE;
	    if (A[j] != A[k] && B[j]==B[k] && color[j] == color[k])
		return FALSE;
	    if (A[j] == B[k] && A[k] != B[j] && color[j] == color[k])
		return FALSE;
	}
    
    return TRUE;
}


main()
{

    if (Verify())
	cout << "Correct!"<<endl;
    else
	cout <<"Wrong!"<<endl;
}