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
Our Free Plans just got better! | Auth0
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.
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.
Finch is a package dependency graph management engine with interfaces in many programming languages (C, Obj-C, Perl, etc). The goal for this project is to provide a robust replacement for the current dependency engine in Fink (fink.sourceforge.net)
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.
Cflow2vcg convert the result of the cflow utility in a VCG format. It offers the ability to view graphically the call-graph of sources, and import it in documentation.
Open Graph Library is an Open Source implementation of a directed, acyclic graph. This library is written in C, but bindings to Java and Python are supported.
Functrace is a tracing facility, similar to ltrace/strace, that can be
used for tracing the dynamic call graph internal to a running program
(i.e. a trace of function calls).
The Graph Implementation and Representation Libraries, or GIRLs, aim to be all-purpose libraries for solving graph theory problems. ie, shortest paths, matching, cycles, connectedness, creating 'random' graphs, etc...
UCLA, "Unamed CVS Log Analyser", is a(nother) CVS log analyser.
Its purpose is to parse a project's CVS log, build a graph for each file representing branches layout, merge them all together and then creates a visual representation of the project.
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.
The Computer History Graphing Project is a project to graph every computer standard, every piece of hardware, every OS, and every computer language in one big family tree.
MSP430static is a tool for the analysis of MSP430 firmware images, such as those produced by TinyOS and mspgcc. Features include call-graph generation, recovery of library symbol names, and easy extensibility in Perl or SQL.
GDI# is a kind of GDI which can be used in both linux and windows, it provides numbers of classes and libraries to share the way to develop software. In both text and graph mode, GDI# supports a serial of functions to develop graphic programmes.