<commit_before># TR-MAZE

This is a Java project to implement the Maze Problem. A maze consists of Walls and Aisles. The program Uses Depth First Search algorithm to find a path from start to finish traversing thru the aisles.

## Getting Started

The input data for the program includes: 

- Maze definition in a 2D array representation (0 for Aisle, 1 for Wall), 
- Maze entrance point
- Maze exit point

Output:
- True if a path available from start to end
- False if no path available from start to end
- There is also a display() method which prints the pictorial representation of the Maze along with the selected solution. 

e.g.
```
for the input maze definition:

	{1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1}, 
	{1,0,0,1,0,1,0,1,0,0,0,0,0,0,0,1}, 
	{1,0,0,1,0,1,0,0,0,1,0,0,0,1,0,1}, 
	{1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1}, 
	{1,0,0,0,0,1,0,0,0,1,0,1,0,1,0,1}, 
	{1,0,1,1,1,1,1,0,1,1,0,1,1,1,0,1}, 
	{1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,1}, 
	{1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1}, 
	{1,0,0,0,0,1,0,0,0,0,1,0,1,0,0,1}, 
	{1,0,1,1,1,1,0,1,0,0,1,0,0,0,0,1}, 
	{1,0,0,0,0,1,0,1,0,1,1,0,1,1,1,1}, 
	{1,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1}, 
	{1,0,1,1,1,1,1,1,0,0,1,1,1,1,0,1}, 
	{1,0,1,0,0,0,0,0,0,1,1,0,0,1,0,1}, 
	{1,0,1,0,1,1,1,0,0,0,0,0,0,1,0,1},
	{1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1}}

start: {0, 2}
end: {15, 14}
```

The program outputs: 
```
xxxxxx * xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxx    * xxx   xxx   xxx                     xxx
xxx *  * xxx   xxx         xxx         xxx   xxx
xxx * xxxxxx   xxx   xxxxxxxxxxxxxxx   xxx   xxx
xxx *          xxx         xxx   xxx   xxx   xxx
xxx * xxxxxxxxxxxxxxx   xxxxxx   xxxxxxxxx   xxx
xxx *  *  *             xxx      xxx         xxx
xxxxxxxxx * xxxxxxxxxxxxxxx   xxxxxxxxxxxxxxxxxx
xxx *  *  *    xxx *  *  *    xxx   xxx      xxx
xxx * xxxxxxxxxxxx * xxx *    xxx            xxx
xxx *  *  *    xxx * xxx * xxxxxx   xxxxxxxxxxxx
xxx   xxx *  *  *  * xxx *  *  *  *  *  *  * xxx
xxx   xxxxxxxxxxxxxxxxxx *  * xxxxxxxxxxxx * xxx
xxx   xxx                  xxxxxx      xxx * xxx
xxx   xxx   xxxxxxxxx                  xxx * xxx
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx * xxx

```

## Executing the program

### With Maven

The program includes a maven plugin to directly execute thru maven command
```
mvn compile exec:java
```

### With Gradle

To execute the program using gradle

```
./gradlew run
```

### Java class thru IDE/command line

Otherwise, the program can be executed thru Ide by running the main() method in MazeRunner.java

## Running the tests

### With Maven

```
mvn test
```

### With Gradle

```
./gradlew test
```
The Gradle test report will be generated in $project/build/reports/index.html

### Java class thru IDE/command line

```
MazeTest.java
```

## License

This project is licensed under the MIT License - see the [LICENSE.md](LICENSE.md) file for details<commit_msg>Update instructions for Maven Wrapper<commit_after># TR-MAZE

This is a Java project to implement the Maze Problem. A maze consists of Walls and Aisles. The program Uses Depth First Search algorithm to find a path from start to finish traversing thru the aisles.

## Getting Started

The input data for the program includes: 

- Maze definition in a 2D array representation (0 for Aisle, 1 for Wall), 
- Maze entrance point
- Maze exit point

Output:
- True if a path available from start to end
- False if no path available from start to end
- There is also a display() method which prints the pictorial representation of the Maze along with the selected solution. 

e.g.
```
for the input maze definition:

	{1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1}, 
	{1,0,0,1,0,1,0,1,0,0,0,0,0,0,0,1}, 
	{1,0,0,1,0,1,0,0,0,1,0,0,0,1,0,1}, 
	{1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1}, 
	{1,0,0,0,0,1,0,0,0,1,0,1,0,1,0,1}, 
	{1,0,1,1,1,1,1,0,1,1,0,1,1,1,0,1}, 
	{1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,1}, 
	{1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1}, 
	{1,0,0,0,0,1,0,0,0,0,1,0,1,0,0,1}, 
	{1,0,1,1,1,1,0,1,0,0,1,0,0,0,0,1}, 
	{1,0,0,0,0,1,0,1,0,1,1,0,1,1,1,1}, 
	{1,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1}, 
	{1,0,1,1,1,1,1,1,0,0,1,1,1,1,0,1}, 
	{1,0,1,0,0,0,0,0,0,1,1,0,0,1,0,1}, 
	{1,0,1,0,1,1,1,0,0,0,0,0,0,1,0,1},
	{1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1}}

start: {0, 2}
end: {15, 14}
```

The program outputs: 
```
xxxxxx * xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxx    * xxx   xxx   xxx                     xxx
xxx *  * xxx   xxx         xxx         xxx   xxx
xxx * xxxxxx   xxx   xxxxxxxxxxxxxxx   xxx   xxx
xxx *          xxx         xxx   xxx   xxx   xxx
xxx * xxxxxxxxxxxxxxx   xxxxxx   xxxxxxxxx   xxx
xxx *  *  *             xxx      xxx         xxx
xxxxxxxxx * xxxxxxxxxxxxxxx   xxxxxxxxxxxxxxxxxx
xxx *  *  *    xxx *  *  *    xxx   xxx      xxx
xxx * xxxxxxxxxxxx * xxx *    xxx            xxx
xxx *  *  *    xxx * xxx * xxxxxx   xxxxxxxxxxxx
xxx   xxx *  *  *  * xxx *  *  *  *  *  *  * xxx
xxx   xxxxxxxxxxxxxxxxxx *  * xxxxxxxxxxxx * xxx
xxx   xxx                  xxxxxx      xxx * xxx
xxx   xxx   xxxxxxxxx                  xxx * xxx
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx * xxx

```

## Executing the program

### With Maven

The program includes a maven plugin to directly execute thru maven command
```
./mvnw compile exec:java
```

### With Gradle

To execute the program using gradle

```
./gradlew run
```

### Java class thru IDE/command line

Otherwise, the program can be executed thru Ide by running the main() method in MazeRunner.java

## Running the tests

### With Maven

```
./mvnw test
```

### With Gradle

```
./gradlew test
```
The Gradle test report will be generated in $project/build/reports/index.html

### Java class thru IDE/command line

```
MazeTest.java
```

## License

This project is licensed under the MIT License - see the [LICENSE.md](LICENSE.md) file for details
{'fraction_non_alphanumeric': 0.1612789880534083, 'fraction_numerical': 0.09311314125087843, 'mean_word_length': 3.2201630837657524, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 26, 'word_list_counts': {'cursed_substrings.json': 56, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5022886', 'n_tokens_mistral': 2753, 'n_tokens_neox': 2416, 'n_words': 599}