// Karlo V. Miranda
// MATH 273 Extra Credit Program

#include <ccc.h>

int main()
	{	int NumberOfVertices	// Number of vertices on graph
		int Edge[10][10]	// Adjacency matrix of graph
//
//      Edge[i][j] = 1 if there is an edge joining vertex i to vertex j.
//      Edge[i][j] = 0 if not
//
//
        int i, j, k;                    // Represent vertices and also counters

// Initialize adjacency matrix without color

	for (i=1; i <= NumberOfVertices; i++)
		for (j=1; <= NumberOfVertices; j++)
			Edge[i][j] = 0;

// Intitialize one color for vertices combination

	for (k=1; k <= NumberOfEdges; k++)
		{  EdgeFile >> i >> j;
		   Edge[i][j] = 1;
		   Edge[j][i] = 1;
  		}

// If statement: 2 Vertices[i][j] are connected by an edge