Showing 47 open source projects for "graph algorithms"

View related business solutions
  • Stop Storing Third-Party Tokens in Your Database Icon
    Stop Storing Third-Party Tokens in Your Database

    Auth0 Token Vault handles secure token storage, exchange, and refresh for external providers so you don't have to build it yourself.

    Rolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
    Try Auth0 for Free
  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    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
  • 1
    OR-Tools - Google Optimization Tools

    OR-Tools - Google Optimization Tools

    Google's software suite for combinatorial optimization

    Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others....
    Downloads: 8 This Week
    Last Update:
    See Project
  • 2
    JGraphT
    JGraphT is a free Java class library that provides mathematical graph-theory objects and algorithms. JGraphT supports a rich gallery of graphs and is designed to be powerful, extensible, and easy to use.
    Leader badge
    Downloads: 144 This Week
    Last Update:
    See Project
  • 3
    The Chemistry Development Kit
    The Chemistry Development Kit (CDK) is a scientific, LGPL-ed library for bio- and cheminformatics and computational chemistry written in Java. The main home page of the CDK is now at: http://cdk.github.io
    Leader badge
    Downloads: 64 This Week
    Last Update:
    See Project
  • 4
    Social Network Visualizer

    Social Network Visualizer

    Social Network Analysis and Visualization software

    Visit our new site: http://socnetv.org Social Network Visualizer (SocNetV) is a social network analysis and visualization application. You can draw a social network (graph/digraph) or load an existing one (GraphML, UCINET, Pajek, etc), compute cohesion, centrality, community and structural equivalence metrics and apply various layout algorithms based on actor centrality or prestige scores (i.e. Eigenvector, Betweenness) or on dynamic models (i.e. Kamada-Kawai spring-embedder)
    Downloads: 5 This Week
    Last Update:
    See Project
  • MongoDB Atlas runs apps anywhere Icon
    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.
    Start Free
  • 5
    RootGraph

    RootGraph

    Graphic interface with algorithms to compute line and root graphs

    Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    Algorithms Math Models

    Algorithms Math Models

    MATLAB implementations of algorithms

    Algorithms_MathModels is a large MATLAB collection of algorithms and solved examples targeted at students and teams preparing for mathematical modeling competitions (national and international contests like MCM/ICM). The repository gathers implementations and case studies across many topics commonly used in contest solutions: optimization (linear, integer, goal and nonlinear programming), heuristic and metaheuristic methods (simulated annealing, genetic algorithms, immune algorithms), neural networks and time-series methods, interpolation and regression, graph theory, cellular automata, grey systems, fuzzy models, partial/ordinary differential equations, and multivariate analysis, among others. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    Pigale
    Pigale is a graph editor and a C++ algorithm library essentially concerned with planar graphs. This software, particularly intended for graph theoretical research, includes new algorithms based on our recent theoretical researches.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    TSP Solver and Generator

    TSP Solver and Generator

    Generate and solve Travelling Salesman Problem tasks

    TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...
    Downloads: 6 This Week
    Last Update:
    See Project
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • 10

    popt4jlib

    Parallel Optimization Library for Java

    popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    Satsuma .NET Graph Library

    Satsuma .NET Graph Library

    a delicious .NET graph library

    Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12

    A star

    it is an implementation of A* algorithm with examples of its usage.

    A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    JAGAL: Java Graph Library

    JAGAL: Java Graph Library

    Java graph library

    JAGAL provides implementations for directed graphs (weighted and unweighted) and varoius types of transition systems as well as utils for graph traversal and modification. JAGAL builds upon the Java library TOVAL (located at http://sourceforge.net/p/toval). To use JAGAL, make sure the TOVAL library is on the build path. This library uses and encloses jGraphX (https://github.com/jgraph/jgraphx). A documentation for JAGAL can be found under http://doku.telematik.uni-freiburg.de/jagal.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15

    ISO GrAF

    Experimental Java library for reading and writing GrAF/XML files.

    The Graph Annotation Framework (GrAF) models linguistic annotations using a data model based on Graph theory and algorithms. The GrAF standard is a work product of ISO TC37SC4 Working Group 1. This Java library is NOT part of the GrAF standard and standoff annotation files produced by the library may not be GrAF compliant.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16

    HRDAG

    Framework for Hierarchical Graph Decomposition

    This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    Graph-RAT
    Graph-RAT is a database abstraction layer designed to make it easy to use a large library of graph-analysis routines on a database as well as add new kinds of algorithms to data mining.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 18

    nail_systems_biology

    NAIL is a toolset for network analysis in the life sciences

    ...However, different algorithms typically use different input and output data types, are implemented using different technologies, and are demonstrated by application to different biological problems. Because of this, the primary goal of the NAIL project is to provide a straightforward way to use network approaches in the life sciences, and to apply a variety of techniques quickly and easily on the same data.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19

    Web graph compression

    web graph compression algorithms implementation

    This project contains the implementation of web graph compression algorithms developed in Technical University of Łódź by Institute of Applied Computer Science.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20

    LTS: Learning to Search

    Discriminative subgraph mining by learning from search history

    ...The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown traits. LTS is an improvement on other subgraph mining algorithms because it uses empirical data from the search history of a first pass to help weed out unpromising search directions. This allows a second pass to spend more time investigating promising areas of search to generate the most discriminative subgraphs more quickly than before.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    MuLaViTo

    MuLaViTo

    A framework for the visualization of multi-layer networks

    MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    Software for graphs visualization, encouraging graph algorithms implementation. Aimed at students who want to code their own algorithms and see a graphical representation of it working.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 25
    A library of graph algorithms non-trivials. An example, chordiallity test, Max-flow, etc...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • Next