adjacency matrix of a directed graph

1/*adjacency matrix implementation of directed graph:
2 0---->1---|
3 |         |---->4
4 |-> 2-->3-|
5 
6 -------------------------------------------------*/
7#include <iostream>
8
9using namespace std;
10#define v 5
11void inti(int mat[][v])
12{
13    for(int i=0;i<v;i++)
14    {
15        for(int j=0;j<v;j++)
16        {
17            mat[i][j]=0;
18        }
19    }
20}
21void addedge(int mat[][v],int start,int endvertix)
22{
23    mat[start][endvertix]=1;
24}
25void printmat(int mat[][v])
26{
27    for(int i=0;i<v;i++)
28    {
29        for(int j=0;j<v;j++)
30        {
31            cout<<mat[i][j]<<" ";
32        }
33        cout<<endl;
34
35    }
36}
37
38int main()
39{
40    int array_in_graph[v][v];
41    inti(array_in_graph);
42    addedge(array_in_graph,0,1);
43    addedge(array_in_graph,0,2);
44    addedge(array_in_graph,0,3);
45    addedge(array_in_graph,1,3);
46    addedge(array_in_graph,1,4);
47    addedge(array_in_graph,2,3);
48    addedge(array_in_graph,3,4);
49    printmat(array_in_graph);
50    return 0;
51}
52