bit_gossip
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
Learn to create a game like Candy Crush
git clone https://github.com/blikoor/godot-match-3.gitblikoor/godot-match-3Note that this project's code is based on another project, but purposely not forked from the original repository, since this project is only used for educational purposes.
Our mission is to bring game creators together and to become better game developers.
Do you want to contribute and help improve your own and our game development skills with Godot? Check out the open issues, suggest improvements and report bugs by opening new ones. 😎
We are building a vertical slice demo that the community can learn from. More details will follow later.
We need your support to improve our programming skills, if your a experience programmer or game developer, consider contributing to the project.
All contributors are welcome. 🙂
This project is licensed under the terms of the MIT license.
more like this
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
Vinculum (vin·cu·lum) is a set of C# autogen bindings for Raylib 5.0 additionally provides some convenience wrappers. R…
search projects, people, and tags