// existence of a path from vertex v1 to v2


	// graph definiton
	int graph [5][5] = {{0,1,1,0,0}, {1,0,1,0,0}, {1,1,0,1,0}, {0,0,1,0,0}, {0,0,0,0,0}};


	//DFS

	//graph definition
	//int graph [5][5] = {{0,1,1,0,1}, {1,0,1,0,1}, {1,1,0,1,0}, {0,0,1,0,1}, {1,1,0,1,0}};

	// graph definiton
	int graph [5][5] = {{0,1,1,0,0}, {1,0,1,0,0}, {1,1,0,1,0}, {0,0,1,0,0}, {0,0,0,0,0}};

	//BFS

	//graph definition
	int graph [5][5] = {{0,1,1,0,1}, {1,0,1,0,1}, {1,1,0,1,0}, {0,0,1,0,1}, {1,1,0,1,0}};

	// graph definiton
	//int graph [5][5] = {{0,1,1,0,0}, {1,0,1,0,0}, {1,1,0,1,0}, {0,0,1,0,0}, {0,0,0,0,0}};




	// is graph connected?


	//graph definition
	int graph [5][5] = {{0,1,1,0,1}, {1,0,1,0,1}, {1,1,0,1,0}, {0,0,1,0,1}, {1,1,0,1,0}};



	// components of a graph
	// DFS

	//graph definition
	int graph [5][5] = {{0,1,1,0,0}, {1,0,0,0,0}, {1,0,0,0,0}, {0,0,0,0,0}, {0,0,0,0,0}};



Maze

	//DFS

	//graph definition
	int graph [9][9] = {{0,1,1,1,0,0,0,0,0},
						{1,0,1,0,0,0,0,0,0},
						{1,1,0,0,0,0,0,0,0},
						{1,0,0,0,1,1,0,0,0},
						{0,0,0,1,0,0,0,0,0},
						{0,0,0,1,0,0,1,1,0},
						{0,0,0,0,0,1,0,0,0},
						{0,0,0,0,0,1,0,0,1},
						{0,0,0,0,0,0,0,1,0}};


	// BFS

	//graph definition
	int graph [9][9] = {{0,1,1,1,0,0,0,0,0},
						{1,0,1,0,0,0,0,0,0},
						{1,1,0,0,0,0,0,0,0},
						{1,0,0,0,1,1,0,0,0},
						{0,0,0,1,0,0,0,0,0},
						{0,0,0,1,0,0,1,1,0},
						{0,0,0,0,0,1,0,0,0},
						{0,0,0,0,0,1,0,0,1},
						{0,0,0,0,0,0,0,1,0}};

\