Hacktober_Aejls11/graphprogram.cpp at main · Aejls/Hacktober_Aejls11 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <iostream.h>
#include <conio.h>

class graph
{
	private:int n;
		int **a;
		int *reach;
		int *pos;
	public:graph(int k=10);
		void create();
		void dfs();
		void dfs(int v,int label);
		int begin(int v);
		int nextvert(int v);
};
void graph::graph(int k)
{
	n=k;
	a=new int *[n+1];
	reach=new int[n+1];
	pos=new int [n+1];
	for(int i=1;i<=n;i++)
		pos[i]=0;
	for(int j=1;j<=n;j++)
		a[j]=new int[n+1];
}
void graph::create()
{
	for(int i=1;i<=n;i++)
	{
		cout<<"Enter the "<<i<<"th row of matrix a:
";
		for(int j=1;j<=n;j++)
			cin>>a[i][j];
	}
	for(int k=1;k<=n;k++)
		reach[k]=0;
}
void graph::dfs()
{
	int label=0;
	for(int i=1;i<=n;i++)
		if(!reach[i])
		{
			label++;
			dfs(i,label);
		}
	cout<<"
The contents of the reach array is:
;
	for(int j=1;j<=n;j++)
		cout<<reach[j]<<"	";
}
void graph::dfs(int v,int label)
{
	cout<<v<<"	";
	reach[v]=label;
	int u=begin(v);
	while(u)
	{
		if(!reach[u])
			dfs(u,label);
		u=nextvert(v);
	}
}
int graph::begin(int v)
{
	if((v<1)&&(v>n))
		cout<<"Bad input
";
	else
		for(int i=1;i<=n;i++)
			if(a[v][i]==1)
			{
				pos[v]=i;
				return i;
			}
	return 0;
}
int graph::nextvert(int v)
{
	if((v<1)&&(v>n))
		cout<<"Bad input
";
	else
		for(int i=pos[v]+1;i<=n;i++)
			if(a[v][i]==1)
			{
				pos[v]=i;
				return i;
			}
	return 0;
}
void main()
{
	clrscr();
	int x;
	cout<<"Enter the no of vertices:
";
	cin>>x;
	graph g(x);
	g.create();
	cout<<"dfs is.....";
	g.dfs();
	getch();
}