directedGraph.c

#include <stdio.h>
#define MaxVertices 100

typedef struct{
  int vertices[MaxVertices];
  int edge[MaxVertices][MaxVertices];
  int numV;
}adjMatrix;

void createGraph(adjMatrix *G, int n)
{
  int i, j;
  G->numV = n;

  printf("input the vertices info:\n");
  for (i = 0; i < G->numV; ++i)
  {
    printf("vertices[%d] =\n", i);
    scanf("%d", &(G->vertices[i]));
  }

  printf("input the edge info:\n");
  for (i = 0; i < G->numV; ++i)
  {
    for (j = 0; j < G->numV; ++j)
    {
      printf("edge[%d][%d]=:", i, j);
      scanf("%d", &(G->edge[i][j]));
    }
  }
}

void outputGraph(adjMatrix *G)
{
  int i, j;

  printf("printf the vertices info:\n");
  for (i = 0; i < G->numV; ++i)
  {
    printf("vertices[%d] = %d\n", i, G->vertices[i]);
  }

  printf("printf the edge info:\n");
  for (i = 0; i < G->numV; ++i)
  {
    for (j = 0; j < G->numV; ++j)
    {
      printf("edge[%d][%d]=: %d\n", i, j, G->edge[i][j]);
    }
  }
}

int main(void)
{
  adjMatrix *G;

  createGraph(G, 6);
  outputGraph(G);

  return 0;
}