Summary
In this chapter, we have learned how to solve an optimal path search problem using Bosque. We have been able to review concepts that we have previously learned throughout this book.
During the project's development, we have learned how to implement Dijkstra's algorithm using Bosque, which will help us build future real-life projects implementing many other well-known algorithms.
At the end of this chapter, we have consolidated our learning about the language, and we are ready to understand any code written in Bosque and create our solutions.
It is time to take one last step in our journey and learn how the Bosque language is implemented, how it works, how to contribute and what’s next. All of these things are presented to you in the next two appendices. In Appendix A: Advanced Topics, you will learn how programming languages are built and dive deep into Bosque project structure. You will also learn how to contribute in order to improve the language...