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.
Try It 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.
Koolon is a simple graph (network) modeling tool with interactive data visualization like Prefuse. It allow to create entities, relations, ontologies, directed and undirected graphs and any abstract network models.
.Net Checker checks all code dependencies in .Net projects to ensure a stable architecture - up to multi-million LOC source trees. Moreover, it can produce flexible DOT-based dependency graphs.
The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.
New customers can spin up VMs, build with AI, and query data at no cost.
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
An Education Microprocessor Simulator, based off the a design by Charles Stroud (http://www.eng.auburn.edu/~strouce/ausim.html), this will extend the capabilities and UI of the original and will have a VHDL implementation for educational purposes.
Diagrammer for .Net Assemblies, also support for Javascript. Good for assembly dependencies. Good for showing the call graph in complex methods. Good for showing the jumps in IL. Good for getting an overview of where the complex parts of a system are.
N3D is a library for 3D related programs, including the related mathematics, primitives, scene graph and environment adapters (OpenGL via Tao, Direct3D).
Bloxipwn (created by BloxiCrown (http://thecrown.comuf.com)) is a simple stat calculator for ROBLOX (http://roblox.com). You enter your stats daily and it generates a graph, summary, and tips depending on your stats.
A graphical Windows ping utility written in C# that allows you to log and graph ICMP respones from multiple hosts. Includes a C# class library for ICMP and ping to use in your own program.
QuillEdit is an enhanced notepad(maybe wordpad also) replacement. It includes all the features in notepad plus Math equation editor, Symbolic calculator, graph plotter, FireEdit syntax highlighter, spelling checker, word counter, and MDI interfaces.
RetinaX is a small and easy open source 3D engine consisting of scene graph, sound API and UI framework (Madgets) implementations for DirectX 9. It is implemented using C# express and DirectX managed API. Official IRC Channel: irc.quakenet.org / #retinax
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.
An Oracle StatsPack analysis tool that will display collected performance statistics via the Oracle StatsPack tool. The provided interface features a graph of snapshots, a chart of database parameters in a grid format to compare and find any changes.
A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)
A SOAP service written in .NET to allow any programmer using any programming language to access the .NET charting software.
It will also contain clients written in multiple language to access this service.
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf.
Requirements:
Microsoft Automatic Graph Layout
http://research.microsoft.com/en-us/projects/msagl/
Gurobi Optimizer
http://www.gurobi.com/
Permutations, Combinations, and Variations using C# Generics
http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G