Directed Graph

Using adjacency matrix to describe directed graph

#include <iostream>
#include <cstdlib>

using namespace std;

int main()
{
    int arr[5][5], tmp_i, tmp_j;
    int data[5][2] = {{1,2},{2,1},{2,3},{2,4},{4,3}};

    for(int i = 0; i < 5; i++)
        for(int j = 0; j < 5; j++)
            arr[i][j] = 0;

    for(int i = 0; i < 5; i++)
    {
        tmp_i = data[i][0];
        tmp_j = data[i][1];
        arr[tmp_i][tmp_j] = 1;
    }

    cout << "The matrix of Directed Graph : \n";

    for(int i = 1; i < 5; i++)
    {
        for(int j = 1; j < 5; j++)
            cout << "[" << arr[i][j] << "] ";
        cout << endl;
    }
    system("PAUSE");
    return EXIT_SUCCESS;
}