Showing 36 of 85 projects
A Ruby framework for graph data structures and algorithms, inspired by the Boost Graph Library.
A lightweight, header-only C++20 graph library designed as a simpler alternative to the Boost Graph Library.
A Neo4j-based library for building high-performance recommendation engines with real-time and pre-computed capabilities.
A Haxe library providing parametrized, cross-platform data structures optimized for game development.
A Python-based local trajectory planner using multilayer graphs for autonomous race vehicles, returning cost-optimal action sets.
A comprehensive, modular graph library for OCaml providing multiple graph implementations and algorithms.
A Go implementation of the TextRank algorithm for automatic text summarization, phrase extraction, and keyword ranking with multithreading support.
A Julia toolkit for graph-based molecule modeling, cheminformatics analysis, and chemical structure manipulation.
A Julia package providing generic graph types, algorithms, and interfaces inspired by the Boost Graph Library.
A comprehensive collection of Common Lisp implementations for competitive programming algorithms and data structures.
A collection of classic algorithms and data structures implemented in Erlang for educational and practical use.
An R package implementing multiple edge bundling, flow map, and metro map layout algorithms for network visualization.
A Clojure Gremlin Language Variant for querying Apache TinkerPop-enabled graph databases.
A comprehensive collection of data structures and algorithms implemented in the Crystal programming language.
A lightweight, modular Java framework for graph theory algorithms with one-line application and custom engine support.
A lightweight, efficient, and easy-to-use generic graph data structure and algorithm library for Go.
Code examples and implementations for studying complex systems, networks, and cellular automata from the Think Complexity book.
A Julia package for graph and network algorithms using matrix-based representations.
A pure Julia package providing layout algorithms for graphs and trees, enabling automatic node positioning for visualization.
IGraph/M is a Wolfram Language interface to the igraph network analysis library, extending Mathematica's graph theory capabilities.
A graph library for the Go programming language providing data structures and algorithms for graph manipulation.
A fast, in-memory graph data structure implementation in Java, optimized for performance and low memory usage.
A Julia package for graph data structures with arbitrary metadata on vertices, edges, and the graph itself, extending Graphs.jl.
A Python solver for convex optimization problems defined on graphs, enabling distributed optimization across network structures.
A lightweight Java library providing basic graph data structures and algorithms with no dependencies.
A collaborative filtering recommendation library in Go that performs random walks on user-item graphs for fast, production-ready recommendations.
A generic Swift math framework for function solving, optimization, matrix algebra, complex numbers, and big integers with performance optimizations.
A protocol-oriented A* pathfinding algorithm implementation in Swift for adding pathfinding to any graph.
An R package implementing the Smith-Pittman community detection algorithm using node degree and edge betweenness for igraph networks.
A generic algorithm library for Crystal programming language providing implementations of common algorithms and data structures.
A flexible Ada library offering generic containers and algorithms with SPARK compatibility and performance control.
A library of custom graph algorithms for Neo4j, including graph generators and path finding, with Java and REST APIs.
A generic A* graph pathfinding implementation in pure Elixir, abstracting graph environment details.
Two algorithms (LPAwb+ and DIRTLPAwb+) for finding weighted modularity in bipartite networks.
A Lua/Torch7 package for creating and manipulating edge-weighted graphs on images for segmentation and analysis.
Provides network interdiction algorithms and MatrixDepot.jl integration for graph analysis in Julia.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.