Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.
Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
Start Free
MongoDB Atlas runs apps anywhere
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
finds the sortest path on the square board. GUI is implemented in Qt.
The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed.
In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. ...
CoRoPa stands for Computational Rough Paths. The aim of CoRoPa is to provide a software framework for various ideas related to Rough Path Theory, including rough differential equations and the digital description of serial data streams.
Very basic path manipulation library. Aims to be simple, intuitive and predictable (not universal).
Works with std::string and std::wstring.
Configurable to support both POSIX and Windows paths (drive letters only - no schemas, network paths etc), as well as some custom formats (with limitations for simplicity).
All configurations understand ".."
CoPP is an object-oriented framework for developing algorithms for robot path planning. One of of the design goals is to make it easy to make comparisons between various path planning algorithms.
It's an implementation of the A* algorithm together with a grid processor which pre-processes 8-bit bpm graphic files using a variable resolution and an SDL user interface to test it.