I create this repository with the purpose of helping students and computer science enthusiasts to understand the Breadth First Search algorithm for any aplication in graphs.
This algorithm travels intelligently a graph inputed to determine a minimal generating tree.
Clang compiler. g++ compiler. Bash shell (if you want the init.sh script).
$ cd Breadth-First-Search-Algorithm
$ chmod +x init.sh
$ ./init.sh <input_file_name>
$ ./init.sh <input_file_name>
- Lucas Fonseca dos Santos - Computer Science student of Federal University of Lavras - [email protected]
This project is licensed under GNU GENERAL PUBLIC LICENSE.