ant_labyrinth. This project was developed for the discipline data structure 1, using a search algorithm in a matrix of 10x10, where the starting point is (1,1) and arrival (10,10), where 0 are valid paths and -1 obstacles. The ncurses library was used for graphical environment in text mode.

Problem

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Audience

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Market

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Pricing

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.