Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Ship Agents Faster
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.
This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.
A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Java Framework for automatic transformation of graph structured Process Models (incl. BPMN import) to block structured BPEL code. A graphical tool is provided for visualisation and testing.
Fiona is a tool to automatically analyze the interactional behavior of a given oWFN. It provides two techniques: it checks for the controllability of the given net by computing the interactiong graph and it calculates the operating guideline for the net.
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.
An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.
Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec
pythag is an algorithm and script for computing primitive Pythagorean triples using the command line. Has an option to output to a file. It also has an option to output to a graph using GLUT, to which it now depends.
Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.
This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.