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.
Try free now
MongoDB Atlas | Run databases anywhere
Ensure the availability of your data with coverage across AWS, Azure, and GCP on MongoDB Atlas—the multi-cloud database for every enterprise.
MongoDB Atlas allows you to build and run modern applications across 125+ cloud regions, spanning AWS, Azure, and Google Cloud. Its multi-cloud clusters enable seamless data distribution and automated failover between cloud providers, ensuring high availability and flexibility without added complexity.
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.
Program predicts a jam for chosen task on road graph. Data example: http://imat2010.yandex.ru There are 30 days with information about jams since 16:00 till 22:00. Need to predict jams at 31st. Algorithm is based on SVM library. BSD license.
Pure Java implementation of an interactive 3d graph rendering engine and editor using a spring embedder algorithm. Nice looking sterile real time 3d environment. Feel free to extend our project and build something awesome, just let us know please :D
C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.
We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network.
G.A.V. (GraphAlgorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
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.
RoxGT its an open source framework for building Graph-based applications. It has been built essentially for academic jobs, such as graphalgorithm execution and theorem proofs.
Trusted by nearly 20,000 customers worldwide, and all major cloud providers.
OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
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.
JPowerGraph is a Java library for creating directed graphs for both Swing and SWT. It supports graph movement, selection, context menus, tooltips and dynamic edge creation. JPowerGraph has a spring layout algorithm based on that used in TouchGraph.
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.
ksudoku is a fully-featured Sudoku puzzle generator and solver for KDE. With it you can generate and play 3D and 2D puzzles of different sizes and levels. The main algorithm is fast and extendable to any general graph coloring problem.
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.
jGABL (the Java GraphAlgorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.
The implementations of finding the k shortest paths (KSP) algorithm. A C/C++ library including some classical graph relative algorithm implementations.
My program to make possible simulation of algorithm on 3-dimensional graph. We can also to create or load 3-dimensional graph and start differents algorithm. On my home page is available this program as applet. You can run applet if you were using a Java
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.
Stand-alone version of OrthoMCL is programmed in PERL, runs in UNIX-like systems. It uses the Markov Clustering Algorithm (MCL) to perform a graph clustering of protein orthologs from multiple eukaryotic genomes.
The "Framework for Implicit Graph Algorithms and Representations by OBDDs" (Figaro) automatically manages experiments with input generator and algorithm plugins. It already contains some generators and algorithms for graph and scheduling problems.
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.)