Showing 74 open source projects for "graph algorithms"

View related business solutions
  • 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
  • Enterprise-grade ITSM, for every business Icon
    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

    Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
    Try it Free
  • 1
    Pytholog

    Pytholog

    A logic programming tool and a logical database with a RESTful API

    Pytholog Tool (Command line & API) An executable tool, built in python, that enables logic programming and prolog syntax through interactive shell that mimics prolog language and / or RESTful API that can be called from other applications. The tool is based on the python library pytholog which can be found here: https://github.com/mnoorfawi/pytholog The tool starts normally from the command line. Let's look at the arguments that can be specified while initiating the tool: $...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    java-string-similarity

    java-string-similarity

    Implementation of various string similarity and distance algorithms

    Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    VivaGraph

    VivaGraph

    Graph drawing library for JavaScript

    ...Its layout algorithms help position nodes in aesthetically pleasing arrangements using force-directed simulations that adjust dynamically as the graph evolves. VivaGraphJS is modular, so you can extend or customize layouts, rendering, and interaction logic to fit specialized applications such as social network analysis, dependency mapping, or knowledge graphs.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    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
  • Our Free Plans just got better! | Auth0 Icon
    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.
    Try free now
  • 5
    Your basic graph

    Your basic graph

    Graph algorithms and data structures

    ...The tool is part of a larger library of generic graph algorithms.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    Path Finder Qt

    finds the sortest path on the square board. GUI is implemented in Qt.

    The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7

    JavaGimmicks

    Utility classes, APIs and tools for Java

    A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    Algorithms in Python

    Algorithms in Python

    Data Structures and Algorithms in Python

    Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    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
  • 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
    algorithms.js

    algorithms.js

    Classic algorithms and data structures implemented in JavaScript

    Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    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
  • 12

    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
  • 13
    Graphal

    Graphal

    Graph algorithms interpreter, IDE, debugger, 3D visualizations.

    Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    SPARGEL

    SPARGEL

    An opensource Java graph library. Abandoned, ignore.

    ...As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15

    Approximate Subgraph Matching Algorithm

    Approximate Subgraph Matching Algorithm for Dependency Graphs

    The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively,...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Asteroid

    Asteroid

    A CBLS Engine in SCALA, NOW part of OscaR

    Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18

    MbPc Pagerank Simulator

    Testbed for playing with the algorithm "pagerank" of Google

    Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 20
    Project consists in a software that reads a copied web site to your computer and generates a graph model of it. The model is based on the links, which are seen as the edges, and the pages, which are the vertices of the graph.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    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.
    Downloads: 3 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
    Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    G.A.V. (Graph Algorithm 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    A basic package that represents graphs along with some basic graph algorithms in Java. The idea is to keep the representation simple, straightforward and documented.
    Downloads: 0 This Week
    Last Update:
    See Project