Question

Request the user to determine the order (IV]) and size (El) of the graph Generate |El random ones into the adjacency matrix/list (Adj) to make a random undirected graph. (Make sure to have a symmetric matrix) Print the resulting adjacency matrix/list. 1. 2. 3.

I'm having trouble using the syntax using MATLAB and I need help for parts 1-3 in MATLAB code if anyone can help me thank you very much.

Answer 1

#include<stdio.h>

#include<malloc.h>

#include<string.h>

typedef struct adjacency{

int vname;

struct adjacency *adj;

} Adj;

typedef struct graph

{

int nvert;

int nedge;

int time;

int fi, st;

int *pi;

char *color;

Adj *base[10];

}G;

//display function

void display(G *g)

{

int i,j=0;

Adj *p;

for(i=0;i<g->nvert;i++)

{

p=g->base[i];

while(p){

printf("%d->",p->vname);

p=p->adj;

}

printf("\n");

}

}

// new graph allocation..............................

G* newgraph()

{

G *g;

Adj *nodes;

int i,k=0;

int u,v;

g=(G*)malloc(sizeof(G));

printf("Enter the number of vertices\n");

scanf("%d",&(g->nvert));

printf("Enter the Vertices\n");

g->pi=(int *)malloc(sizeof(int)*((g->nvert)+1));

g->fi=(int *)malloc(sizeof(int)*((g->nvert)+1));

g->st=(int *)malloc(sizeof(int)*((g->nvert)+1));

g->color=(char*)malloc(sizeof(char)*((g->nvert)+1));

for(i=0;i<g->nvert;i++)

{

g->pi[i]=-1;

g->color[i]='W';

g->base[i]=(Adj*)malloc(sizeof(Adj));

scanf("%d",&(g->base[i])->vname);

(g->base[i])->adj=NULL;

}

g->pi[i]=-1;

g->color[i]='W';

g->base[i]=NULL;

printf("Enter the number of edges in graph\n");

scanf("%d",&(g->nedge));

printf("Enter the Edges\n");

for(i=0;i<g->nedge;i++)

{

scanf("%d%d",&u,&v);

nodes=(Adj*)malloc(sizeof(Adj));

nodes->vname=u;

while(((g->base[k])->vname!=v)&&(g->base[k]))

k++;

if(g->base[k])

{

nodes->adj=(g->base[k])->adj;

(g->base[k])->adj=nodes;

k=0;

}

//second node....................

nodes=(Adj*)malloc(sizeof(Adj));

nodes->vname=v;

while(((g->base[k])->vname!=u)&&(g->base[k]))

k++;

if(g->base[k])

{

nodes->adj=(g->base[k])->adj;

(g->base[k])->adj=nodes;

k=0;

}

}

g->time=0;

return g;

}

// dfs visit...............

void dfs_visit(G g, Adj u)

{

Adj *v;

int i=0;

g->color[u->vname]='G';

g->time=g->time+1;

g->st[u->vname]=g->time;

v=u->adj;

while(v)

{

if(g->color[v->vname]=='W')

{

g->pi[v->vname]=u->vname;

while(((g->base[i])->vname)!=v->vname)

i++;

dfs_visit(g,g->base[i]);

}

v=v->adj;

}

g->color[u->vname]='B';

g->time=g->time+1;

g->fi[u->vname]=g->time;

}

//dfs of graph............

void dfs(G g, Adj s)

{

int i;

dfs_visit(g,s);

for(i=0;i<g->nvert;i++)

if((g->color[(g->base[i])->vname])=='W')

dfs_visit(g,g->base[i]);

}

int main()

{

G *g=newgraph();

int s;

printf("Enter the index source vertex....\n");

scanf("%d",&s);

display(g);

dfs(g,g->base[s]);

for(s=0;s<g->nvert;s++)

printf("%d\t%c\n",g->pi[(g->base[s])->vname],g->color[(g->base[s])->vname]);

printf("\n\n");

printf("\nStarting time finishiing time:\n");

for(s=0;s<g->nvert;s++)

printf("%d\t%d\n",g->st[(g->base[s])->vname],g->fi[(g->base[s])->vname]);

return 0;

}

#include<stdio.h>

#include<malloc.h>

typedef struct queue{

int data;

struct queue *link;

}Q;

void create(Q *front, Q *rear)

{

*front=*rear=NULL;

}

//////ENQUEUE

void enqueue(Q *front, Q *rear, int a)

{

Q *newn;

newn=(Q *)malloc(sizeof(Q)*1);

newn->data=a;

if(newn==NULL)

{

printf("Queue is full");

}

else{

if(*front==NULL)

{

*front=*rear=newn;

}

else{

(*rear)->link=newn;

*rear=newn;

}

}

}

////////////////////////////////////

int dequeue(Q *front, Q *rear)

{

int t;

Q *ptr;

if(*front==NULL)

{

printf("Q Is EMp\n");

return -1;

}

else

{

t=(*front)->data;

ptr=*front;

if(*front==*rear)

{

*front=*rear=NULL;

}

else

*front=(*front)->link;

free(ptr);

return t;

}

}

int main()

{

Q *first,*second;

int i,j,k,n,e,*visit,**a;

printf("\nEnter the number of vertices:");

scanf("%d",&n);

a=(int**)malloc(n*(sizeof(int*)));

for(i=0;i<n;i++)

a[i]=(int*)malloc(n*sizeof(int));

visit=(int*)malloc(n*sizeof(int));

for(i=0;i<n;i++)

for(j=0;j<n;j++)

a[i][j]=0;

for(i=0;i<n;i++)

visit[i]=0;

printf("\nEnter the number of Edges:");

scanf("%d",&e);

for(i=0;i<e;i++)

{

printf("Enter the %d Edge:",i+1);

scanf("%d%d",&j,&k);

a[j][k]=a[k][j]=1;

}

create(&first,&second);

enqueue(&first,&second,0);

while(first!=NULL)

{

i=dequeue(&first,&second);

printf("V%d\t",i);

visit[i]=1;

for(j=0;j<n;j++)

if((a[i][j]==1)&&(visit[j]==0))

{

enqueue(&first,&second,j);

visit[j]=1;

}

}

return 0;

}