int main() {
int map[NODESIZE][NODESIZE]= {
{0,1,0,0,0,1,1},
{1,0,0,0,0,1,0},
{0,0,0,1,1,0,0},
{0,0,1,0,1,0,1},
{0,0,1,1,0,1,0},
{1,1,0,0,1,0,0},
{1,0,0,1,0,0,0}
};
int answer[NODESIZE];
answer[0]=STARTNODE;
int visited[NODESIZE]= {};
visited[STARTNODE]=1;
printf("use backtrace:\n");
backtrace(map,answer,1,visited);
printf("use DFS:\n");
dfs_search(map);
printf("use BFS:\n");
bfs_search(map);
}
int main()
{
struct Graph *node;
int num,i,j,naddj,adj,s;
printf("enter total number of node : ");
scanf("%d",&num);
node=create(num);
for(i=0;i<num;i++)
{
printf("enter the no of adj for %d node",i);
scanf("%d",&naddj);
for(j=0;j<naddj;j++){
printf("enter the adj node as num: ");
scanf("%d",&adj);
insert(node,i,adj);
}
}
display(node);
printf("enter the source vertx");
scanf("%d",&s);
bfs_search(node,s);
printall(node);
}
