Graph C++ vectors

[stansmith]

I got the program to run right but for some reason when i select option D which is to show the total amount of even and odd vectors it just shows me the matrix again. please any help would be awesome.

#include <string.h>

const int defMaxGraphSize = 10, // Default number of vertices
vertexLabelLength = 11, // Length of a vertex label
filenameLength = 11, // Length of a filename
infiniteEdgeWt = 9999;



class Vertex
{
public:

char label [vertexLabelLength]; 
};


class WtGraph
{
public:


WtGraph ( int maxNumber = defMaxGraphSize );


~WtGraph ();


int load(char *filename);
void insertVertex ( Vertex newVertex ); // Insert vertex
void insertEdge ( char *v1, char *v2, int wt ); // Insert edge
int retrieveVertex ( char *v, Vertex &vData ) const;
// Get vertex
int edgeWeight ( char *v1, char *v2, int &wt );
// Get edge wt.
void removeVertex ( char *v ); // Remove vertex
void removeEdge ( char *v1, char *v2 ); // Remove edge
void clear (); // Clear graph


int empty () const; 
int full () const;
void degree();


void showStructure ();

private:


int index ( char *v ) const; // Converts vertex label to an

int& edge ( int row, int col ); // Set/get edge weight using



int maxSize, // Maximum number of vertices in the graph
size; // Actual number of vertices in the graph
Vertex *vertexList; // Vertex list
int *adjMatrix; // Adjacency matrix
};



#include <iostream>
#include <fstream>
#include <string>
#include <assert.h>

using namespace std;


WtGraph:: WtGraph ( int maxNumber )


: maxSize(maxNumber),
size(0)
{
vertexList = new Vertex [ maxSize ];
assert ( vertexList != 0 );

adjMatrix = new int [ maxSize*maxSize ];
assert ( adjMatrix != 0 );
}


WtGraph:: ~WtGraph ()



{
delete [] vertexList;
delete [] adjMatrix;
}


int WtGraph:: load ( char *filename )
{
Vertex testVertex; // Vertex
char cmd, v1[vertexLabelLength], v2[vertexLabelLength];
int wt;
ifstream infile;
infile.open(filename);
infile >> cmd;
while (cmd != '#')
{
if (cmd == 'v')
{
infile >> v1;
strcpy(testVertex.label,v1);
insertVertex(testVertex);
}
else
{
infile >> v1 >> v2 >> wt;
insertEdge(v1,v2,wt);
}
infile >> cmd;
}
infile.close();
return 1;
}



void WtGraph:: degree()
{
// This is where it is supposed to add up odds and evens.
int even = 0;
int odd = 0;
int sum = 0;
int i = 0, j = 0;
while(edge(i,j) != infiniteEdgeWt)
{
for(i=0; i < size; i++)
{
for(j=0; i < size; j++)
{
if(edge(i,j) < infiniteEdgeWt)
{
sum = sum + edge(i,j);
}
if(sum == 0)
{
even=even + 1;
}
else
{
odd = odd +1;
}
cout << "The sum of the row is: " << sum << endl;
cout << "Even Rows: " << even << endl;
cout << "Odd Rows: " << odd << endl;
}
sum = 0;
}
}
return;
}


void WtGraph:: insertVertex ( Vertex newVertex )



{
int pos, 
j; 

assert ( size != maxSize ); 

pos = index(newVertex.label);
vertexList[pos] = newVertex;

if ( pos == size )
{
size++;
for ( j = 0 ; j < size ; j++ )
{
edge(size-1,j) = infiniteEdgeWt;
edge(j,size-1) = infiniteEdgeWt;
}
}
}


void WtGraph:: insertEdge ( char *v1, char *v2, int wt )


{
int idx_v1 = index(v1), 
idx_v2 = index(v2); 

assert ( idx_v1 != size && idx_v2 != size );

edge(idx_v1,idx_v2) = wt;
edge(idx_v2,idx_v1) = wt;
}



int WtGraph:: retrieveVertex ( char *v, Vertex &vData ) const


{
int pos,
result; 

pos = index(v);
if ( pos != size )
{
vData = vertexList[pos];
result = 1;
}
else
result = 0;

return result;
}


int WtGraph:: edgeWeight ( char *v1, char *v2, int &wt )


{
int idx_v1 = index(v1), 
idx_v2 = index(v2);

assert ( idx_v1 != size && idx_v2 != size );

wt = edge(idx_v1,idx_v2);
return ( wt != infiniteEdgeWt );
}


void WtGraph:: removeVertex ( char *v )

{
int idx_v = index(v), 
j, k; /
assert ( idx_v != size );

for ( j = idx_v ; j < size-1 ; j++ ) 
vertexList[j] = vertexList[j+1];

for ( j = idx_v ; j < size-1 ; j++ ) 
for ( k = 0 ; k < size ; k++ )
edge(j,k) = edge(j+1,k);

for ( j = idx_v ; j < size-1 ; j++ ) 
for ( k = 0 ; k < size ; k++ )
edge(k,j) = edge(k,j+1);

size--;
}


void WtGraph:: removeEdge ( char *v1, char *v2 )

{
int idx_v1 = index(v1),
idx_v2 = index(v2); 

assert ( idx_v1 != size && idx_v2 != size );

edge(idx_v1,idx_v2) = infiniteEdgeWt;
edge(idx_v2,idx_v1) = infiniteEdgeWt;
}


void WtGraph:: clear ()



{
size = 0;
}



int WtGraph:: empty () const

{
return ( size == 0 );
}


int WtGraph:: full () const



{
return ( size == maxSize );
}


void WtGraph:: showStructure ()

{
int wt, 
row, col; 

if ( size == 0 )
cout << "Empty graph" << endl;
else
{
cout << endl << "Vertex list : " << endl;
for ( row = 0 ; row < size ; row++ )
cout << row << '\t' << vertexList[row].label << endl;

cout << endl << "Edge matrix : " << endl << '\t';
for ( col = 0 ; col < size ; col++ )
cout << col << '\t';
cout << endl;
for ( row = 0 ; row < size ; row++ )
{
cout << row << '\t';
for ( col = 0 ; col < size ; col++ )
{
wt = edge(row,col);
if ( wt == infiniteEdgeWt )
cout << "- \t";
else
cout << wt << '\t';
}
cout << endl;
}
}
}


int WtGraph:: index ( char *v ) const



{
int j; 

for ( j = 0 ;
j < size && strcmp(vertexList[j].label,v) != 0 ;
j++ );
return j;
}


int& WtGraph:: edge ( int row, int col )


{
return adjMatrix[maxSize*row+col];
}




void main()
{
WtGraph testGraph(10); // Test graph
Vertex testVertex; // Vertex
char v1[vertexLabelLength],
v2[vertexLabelLength], // Vertex labels
filename[filenameLength], // Filename
cmd; // Input command
int wt; // Edge weight

cout << endl << "Commands:" << endl;
cout << " L : Load a weighted graph" << endl;\
cout << " +v : Insert (or update) vertex v" << endl;
cout << " =v w wt : Insert an edge with weight wt between "
<< "vertices v and w" << endl;
cout << " ?v : Retrieve vertex" << endl;
cout << " #v w : Display the weight of the edge between "
<< "vertices v and w" << endl;
cout << " -v : Remove vertex v" << endl;
cout << " !v w : Remove the edge between vertices v and w"
<< endl;
cout << " D : Output the number of even and odd degree vertices" << endl;
cout << " C : Clear the graph" << endl;
cout << " E : Empty graph?" << endl;
cout << " F : Full graph?" << endl;
cout << " Q : Quit the test program" << endl;
cout << endl;

do
{
testGraph.showStructure(); // Output graph

cout << endl << "Command: "; // Read command
cin >> cmd;
if ( cmd == '+' || cmd == '?' || cmd == '-' )
cin >> v1;
else if ( cmd == '#' || cmd == '!' )
cin >> v1 >> v2;
else if ( cmd == '=' )
cin >> v1 >> v2 >> wt;
else if (cmd == 'L' || cmd == 'l')
{
cout << "Enter filname: ";
cin >> filename;
}

switch ( cmd )
{
case '+' : // insertVertex
cout << "Insert vertex : " << v1 << endl;
strcpy(testVertex.label,v1);
testGraph.insertVertex(testVertex);
break;

case '=' : // insertEdge
cout << "Insert edge : " << v1 << " " << v2 << " "
<< wt << endl;
testGraph.insertEdge(v1,v2,wt);
break;

case '?' : // retrieveVertex
if ( testGraph.retrieveVertex(v1,testVertex) )
cout << "Vertex " << v1 << " exists" << endl;
else
cout << "Vertex NOT found" << endl;
break;

case '#' : // edgeWeight
if ( testGraph.edgeWeight(v1,v2,wt) )
cout << "Weight = " << wt << endl;
else
cout << "No edge between these vertices" << endl;
break;

case '-' : // removeVertex
cout << "Remove vertex " << v1 << endl;
testGraph.removeVertex(v1);
break;

case '!' : // removeEdge
cout << "Remove the edge between vertices "
<< v1 << " and " << v2 << endl;
testGraph.removeEdge(v1,v2);
break;

case 'C' : case 'c' : // clear
cout << "Clear the graph" << endl;
testGraph.clear();
break;

case 'E' : case 'e' : // empty
if ( testGraph.empty() )
cout << "Graph is empty" << endl;
else
cout << "Graph is NOT empty" << endl;
break;

case 'F' : case 'f' : // full
if ( testGraph.full() )
cout << "Graph is full" << endl;
else
cout << "Graph is NOT full" << endl;
break;

case 'L' : case 'l' : // load
if ( testGraph.load(filename) )
cout << "Graph loaded from " << filename << endl;
else
cout << "Invalid input file" << endl;
break;

case 'D' : case 'd' : // output even/odd degree count
testGraph.degree();
break;

case 'Q' : case 'q' : // Quit test program
break;

default : // Invalid command
cout << "Invalid command" << endl;
}
}
while ( cmd != 'Q' && cmd != 'q' );
}