Assignment 9 – Graph Part II

Description

OBJECTIVES

1. Applications of Depth First Traversal

Overview

In this homework assignment, you will apply Depth First Traversal to finding a path through an irregular network of paths.

Graph Class

Your solutions should implement DFT to search for a path through a puzzle starting at a source node (0, 0) and ending at a destination node (n-1, n-1). You have been provided with a header file (Puzzle.hpp) that lays out the paths. Although you are not allowed to modify the header file., you may implement helper functions in your .cpp file as long as you don’t add them to the Puzzle class.

Your puzzle will utilize the following struct:

struct vertex;

struct adjVertex{

vertex *v;

};

struct vertex{

int vertexNum;

bool visited = false;

vector<adjVertex> adj;

};

– Data Structures

Instructor:

Consider a puzzle of 0s and 1s, where 0 indicates a possibility of a path, and 1 indicates a wall, and we are trying to search for a path starting from (x = 0, y=0) to (x = 4, y = 4).

x\y	0	1	2	3	4
0	0	1	1	0	1
1	1	0	0	0	1
2	1	0	1	0	0
3	0	1	0	1	1
4	1	0	1	0	0

This puzzle will be represented using a graph of 13 nodes (13 zeros or possibilities of path), where each node is numbered based on the position of the node in the puzzle (y + n*x) where n

• number rows/columns in the puzzle. The following grid, numbers each node based on its position (For example, (2, 3) is 3+5*2 = 13). The walls are highlighted blue, and the open positions are highlighted red.

x\y	0	1	2	3	4
0	0	1	2	3	4
1	5	6	7	8	9
2	10	11	12	13	14
3	15	16	17	18	19
4	20	21	22	23	24

This puzzle in its graph form is represented as following adjacency list:

0	→ [6]	14	→ [8, 13]
3	→ [7, 8]	15	→ [11, 21]
6	→ [0, 7, 11]	17	→ [11, 13, 21, 23]
7	→ [3, 6, 8, 11, 13]	21	→ [15, 17]
8	→ [3, 7, 13, 14]	23	→ [17, 24]
11 → [6, 7, 15, 17]		24	→ [23]
13 → [7, 8, 14, 17]

– Data Structures

Instructor:

The path highlighted in red is one potential path from 0 to 24:

0→6→7→8→13→17→23→24

Member Functions

void createDefaultPuzzle();

• Using the private member n of the Puzzle class, create a default puzzle of all 1s of size n x n, except for positions (0,0) and (n-1, n-1). Store it as the private member int **puzzle.

• Note: Think of int** as an array of arrays or an array of integer pointers (int*).

• 1. • Allocate memory required by n int*, and

• 1. • For each int* allocate memory required by n integers.

• 1. • This results in a 2D array used to store 0s, and 1s for the puzzle.

void createPath(int i, int j);

• Create an open path at position (x = i, y = j) by inserting a 0 at that position in the puzzle.

void printPuzzle();

➔ Display the puzzle

Format for printing:

If we create a puzzle with the following structure (for n = 3)

puzzle.createDefaultPuzzle();
puzzle.createPath(0, 0);		0	1	1
puzzle.createPath(1, 1);
		1	0	1
puzzle.createPath(2, 2);
		1	1	0

We print the puzzle in the following manner with spaces and pipes in between elements.

| 0		| 1		| 1		|
|	1	|	0	|	1	|
|	1	|	1	|	0	|

– Data Structures

Instructor:

int findVertexNumFromPosition(int x, int y);

• Use the private member n of the class to return the vertex number using the formula y + num_rows_cols_in_puzzle * x

void addVertex(int num);

• Add a new vertex with the given number to the graph.

void addEdge(int v1, int v2);

• Add an edge between from v1 to v2, and from v2 to v1 if the edge doesn’t already exist.

void displayEdges();

• Display all the edges in the graph. Format for printing:

Consider we create a graph with the following structure from the puzzle on the right:

graph.addVertex(0);	| 0		| 1		| 1		|
graph.addVertex(4);	|	1	|	0	|	1	|
graph.addVertex(8);	|	1	|	1	|	0	|
graph.addEdge(0, 4);
graph.addEdge(4, 8);

We print the edges in the following manner.

0	–> 4
4	–>	0	8
8	–>	4

vector<int> findOpenAdjacentPaths(int x, int y); // provided to you

• For a given position (x, y) in the puzzle, the function returns a vector of vertex numbers of all the open path positions in all 8 directions (North, South, East, West, North-West, North-East, South-West, and South-East).

– Data Structures

Instructor:

void convertPuzzleToAdjacencyListGraph();

• For each position x,y in the puzzle, if the position is an open path (not a wall),

• • find its vertex number in the graph

• • find its adjacent vertices by checking for open paths in all 8 directions in the puzzle. Please use the provided helper function findOpenAdjacentPaths.

• • Add the vertex, and its adjacent vertices to the graph.

• • Add the edges between the vertex and its adjacent vertices to the graph.

bool checkIfValidPath();

• Check if the private member vector<int> path is a valid path:

• • First vertex must be 0

• • Last vertex must be (n^2 -1)

• • Every vertex must be an adjacent vertex to the previous vertex in the vector.

• If it is, return true, otherwise, return false.

bool findPathThroughPuzzle();

• This method returns True if it found a valid path through the puzzle, else it returns False.

• It also populates the private member path vector with vertex numbers from source to the destination.

• Implement Depth First Traversal on the graph using recursion.

• While performing depth first traversal on the graph, print information every time you reach a new vertex while exploring a path, and every backtracking step in the traversal using the following format on the next page.

– Data Structures

Instructor:

• for the starting position (0, 0) cout << “Starting at vertex: 0” << endl;

• when you reach a new position

cout << “Reached vertex: “ << v->vertexNum << endl;

// when you backtrack to a previous position

cout << “Backtracked to vertex: “ << v->vertexNum << endl;

Order of function implementation

• Constructor

• createDefaultPuzzle, createPath and printPuzzle

• findVertexNumFromPosition and Destructor

• addVertex, addEdge and displayEdges

• findOpenAdjacentPaths

• findPathThroughPuzzle

• checkIfValidPath