Cloud Run deploys apps in any language instantly. Scales to zero. Pay only when code runs.
Skip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
Try it free
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.
callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.
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
Learn how to protect your Microsoft 365 data, with simple, actionable tips today.
Watch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
Dynagraph for Windows is a graph editor and front-end for the platform-independent Dynagraph graph layout engines. It consists of the Montage OLE Client-Server library, COM wrappers for Dynagraph, and graph editing components.
Domify is a Java library which adapts an arbitrary graph of Java objects to a W3C DOM interface. The DOM nodes are lazy-loaded to minimize processing overhead.
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.
PRE4J (Partial RDF Encryption API for Jena) is a lightweight API for encrypting selected RDF graph elements. PRE4J provides cryptographic extensions to the Jena Semantic Web Framework.
Graph Package (GPack) is a solution for developing simple graphics in Delphi environment. GPack includes 2 components TGraph & TGraph3D which help users to create 2D/3D graphic applications in an easiest and quickest way.
OGNL.net is a port of OGNL in Java platform. OGNL stands for Object Graph Navigation Language. It is an expression and binding language for getting and setting properties of Java objects. Now it work on .Net Object.
GraphSmart is a collection of graph data structures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.
This is a logging API for Ada. It's not a port of log4j. This library seeks to be ultra-flexible whereas log4j was designed to be efficient. The design is essentially a graph of message stream arcs and message processing nodes.
NanoGraph is a java component for graph visualisation. It aims to visualize domain oriented object models without requiring code changes to these models. Design goals include a small footprint and Swing/SWT/SVG support.
Ada to GXL is a factextractor translating from Ada Source code to the Graph eXchange Language (http://www.gupro.de/GXL/) to support reengineering. The Ada ASIS library and the GNAT compiler will be used for the translation.
A Java package to read and manipulate graphs in the GXL (Graph eXchange Language) format, as well as providing a GXL graph editor. Note from admin: This project is discontinued, send me a message if you want to take over.
e4Graph is a C++ library and a Tcl binding providing persistent, reliable, cross-platform storage for graph like structures. Please visit http://e4graph.sourceforge.net for more info.
The project ASHWOOD has a goal to create an open source Java implementation
of graphs, graph related algorithms, and other useful concepts and algorithms
of CS, Applied Mathematics, and their applications.
Provides the implementation of an adjacency-list based graph. Edges and nodes can be decorated with extra (user-provided) information. Depth-first and breadth-first algorithms are also provided.
Some of the features are:
-create and configure a State Tr