Help with 2 dimensional static arrays in a adjancey matrix

im trying to make a 2 dimensional consisting of 0's and when i enter a vertex it should change it to a 1. This is my output so far though

C:\Program Files\Microsoft Visual Studio 10.0\VC>graph
Enter first vertex 2
Enter second vertex 2
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.
0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC0024F8EC
.

and this is my code

Driver

#include <string>
#include <iostream>
#include "graph.h"
using namespace std;

int main()
{
graphType g;
int v1;
int v2;
cout << "Enter first vertex ";
cin >> v1;
cout << "Enter second vertex ";
cin >> v2;

try {

g.initialize(0);
g.addVertex();
cout << g.toString();
g.isEdge(v1, v2);
g.addEdge(v1, v2);

}
catch(string e){
cout << e;
}
}

Header

#include <string>
using namespace std;

class graphType
{
public:
void initialize(int n);
void addVertex();
void addEdge(int v1, int v2);
void removeEdge(int v1, int v2);
void isEdge(int v1, int v2);
void Makearray();
bool isFull();
string toString();


private:
int numberOfVertices;
int Edgea[10][10];
};

and cpp

#include <string>
#include <iostream>
#include "graph.h"
#include <sstream>
using namespace std;


void graphType::Makearray(){
int i=0;
while (i<10){
int j=0;
while (j<10){
Edgea[i][j] = 0;
j = j+1;
}
i = i+1;
}
}
void graphType::initialize(int n){
numberOfVertices = n;
}
void graphType::addVertex(){
numberOfVertices = numberOfVertices + 1;
}
void graphType::addEdge(int v1, int v2){
if (v1 > 10 || v2 > 10){
throw string("vertex is out of range ");
}
if(Edgea[v1][v2] == 1){
throw string("edge already exists ");
}
Edgea[v1][v2] = 1;
}
void graphType::removeEdge(int v1, int v2){
Edgea[v1][v2] = 0;
}
void graphType::isEdge(int v1, int v2){
if (Edgea[v1][v2] == 1)
{
throw string("There is an edge");
}
}
bool graphType::isFull(){
if (numberOfVertices>10){
return true;
}
else{
return false;
}
}
string graphType::toString()
{
stringstream s;
int i=0;
while(i<10)
{
int j=0;
while(j<10)
{
s << Edgea[i][j];
j = j+1;
cout << s;
}
cout << ".\n";
i = i+1;
}
return 0;
}

Thanks in advance!