- A maze can be represented as a graph. This project takes a text-file's path that hava a maze inside from the user and convert the maze into a graph.
- Each space represents a vertex.
- Program solves the maze using four different ways:
- Cheapest Path Algorithm
- Shortest Path Algorithm
- Breadth-First Search
- Depth-First Search
- As an output, it prints edges, pathes and adjacency matrix.