Projects sharing features with Valhalla

OSMnx is a Python library for downloading, modeling, and analyzing street networks and other geospatial features from OpenStreetMap. It enables users to retrieve and work with real-world infrastructure data anywhere in the world, providing tools for network analysis, spatial queries, and visualization. The library offers capabilities for working with urban features such as building footprints, transit stops, and elevation data, along with network statistics like intersection density and circuity. It supports multiple travel modes including driving, walking, and biking, and can calculate short

This project is a reference library of architectural blueprints, study materials, and design patterns for building scalable, high-availability distributed systems. It serves as a technical guide for scalability engineering, providing structural solutions for common engineering challenges. The repository focuses on distributed systems design, covering essential patterns for data replication, consensus algorithms, and transaction management. It distinguishes itself by offering detailed blueprints for specialized domains, including real-time data streaming, large-scale data storage, and high-ava

OsmAnd is a mobile navigation application and vector map viewer that uses OpenStreetMap data to provide offline map access, turn-by-turn routing, and geospatial tools. It functions as a mobile routing engine and a GPX track recorder, allowing users to navigate and record movement without an active internet connection. The project integrates a mobile interface for contributing to the OpenStreetMap project, enabling users to report map errors and add new points of interest directly from their devices. It also includes a system for visualizing satellite imagery and custom tile overlays on top of

Memgraph is an in-memory, distributed graph database designed for high-performance labeled property graph management. It utilizes a Cypher query engine for declarative data retrieval and manipulation, providing a scalable knowledge graph backend that integrates vector search and graph traversals. The system distinguishes itself as a real-time graph analytics platform, employing native C++ and CUDA implementations to execute complex network analysis and dynamic community detection on streaming data. It provides specialized support for AI integration, including GraphRAG capabilities, the constr

This project is a data structures and algorithms library providing a collection of fifty standard code implementations for managing data and solving common computational problems. It serves as an algorithm implementation reference and study resource for educational use. The codebase covers graph theory implementations for modeling networks and performing searches, as well as string pattern matching libraries for the retrieval of character sequences. It includes a collection of hierarchical data structures, such as binary search trees and priority heaps, and provides optimized solutions for dy

This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

This project is a collection of reference implementations for algorithms, mathematics, cryptography, compression, and machine learning written in C#. It serves as an educational library providing standard implementations of sorting, searching, and graph theory algorithms. The repository covers a wide range of computational domains, including combinatorial optimization for constraint satisfaction and scheduling, as well as symmetric and classical cryptographic ciphers. It also provides reference code for lossless data compression techniques and fundamental machine learning primitives such as r

gmaps is a library that provides a wrapper for the Google Maps API, serving as a geospatial data toolkit and interactive map renderer. It simplifies the integration of interactive maps into web applications by managing the embedding of map views and the lifecycle of markers. The project distinguishes itself through a specialized set of utilities for geocoding, which converts physical addresses to geographic coordinates and vice versa. It also includes a static map generator for creating non-interactive map images for lightweight environments. The capability surface covers geographic data vis

Baritone is a pathfinding library and automation bot for Minecraft. It provides a programmatic navigation engine that implements A* pathfinding to calculate and execute movement paths for characters within three-dimensional block-based environments. The system distinguishes itself through a navigation API that allows external clients to embed movement logic and waypoint management. It features a command-based configuration interface for modifying settings via chat and employs memory-mapped environment caching to accelerate the retrieval of long-distance routes. Its capabilities cover a wide

mini-tokyo-3d is a 3D transit map visualization system that renders public transport networks and vehicle movements in real time using open data. It functions as a real-time transit tracker and an interactive transport route finder, providing a WebGL map embed that can be integrated into web pages and external applications. The system features a multilingual transit interface that translates transport identifiers and navigation elements into multiple languages. It tracks vehicle positions by simulating movements based on live timetables and service delay information. The project covers publi

som-tsp is a combinatorial optimization tool designed to solve the Traveling Salesperson Problem using a neural network approach. It functions as a solver that approximates the shortest possible route to visit a set of coordinate-based city locations exactly once and return to the starting point. The system employs a neural network architecture combined with circular array encoding to determine route paths. It includes a visualization system that generates graphical maps and distribution charts to analyze the efficiency and layout of the calculated route solutions. The tool provides utilitie

This project is a comprehensive technical interview preparation resource and computer science interview guide. It serves as an educational reference for developers to study core software engineering fundamentals and common coding patterns required for employment screenings. The repository provides detailed guides and references covering data structures and algorithms, networking and security, operating systems, and web development. It specifically focuses on the implementation and complexity analysis of sorting, searching, and graph algorithms. The material encompasses a wide breadth of comp

This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

This repository is a comprehensive collection of fully worked solutions to exercises and problems from the standard algorithms textbook by Cormen, Leiserson, Rivest, and Stein (CLRS). It serves as an educational reference for algorithm design and analysis, providing step-by-step reasoning, pseudocode, and mathematical proofs for a wide range of topics. The content spans core computer science areas: algorithm analysis with asymptotic notation, recurrence solving, and amortized cost analysis; data structure implementation and operations for binary search trees, red-black trees, B-trees, Fibonac

Gonum is a numerical computing library for the Go programming language, providing a collection of packages for scientific computing, linear algebra, statistics, and optimization. It functions as a framework for performing complex numerical computations and solving systems of linear equations. The project includes a dedicated graph analysis framework for modeling network graphs and solving connectivity and pathfinding problems. It also provides a statistical analysis toolkit for computing descriptive and inferential statistics and estimating mixture entropy. The library's capability surface c

This project is a C# algorithms library and collection of data structures. It serves as a computer science reference providing practical implementations of classic sorting, searching, and graph traversal patterns. The library includes a dedicated string processing toolkit for analyzing text similarity, computing edit distances, and managing prefix-based searches. It also features a graph theory implementation for modeling network relationships and calculating shortest paths. The codebase covers a broad range of capabilities, including the management of linear and hierarchical collections, tr

Orange3 is a visual data mining platform that provides an interactive canvas for building data analysis workflows without writing code. At its core, it offers a widget-based visual programming environment where users connect configurable components to perform data preprocessing, machine learning model training, statistical evaluation, and interactive visualization. The platform is built on NumPy-backed data tables with domain descriptors that define variable names, types, and roles, and includes a lazy SQL query proxy for working with database tables without loading all data into memory. The

petgraph is a graph data structure library for the Rust programming language. It provides a collection of tools for representing and manipulating graphs, functioning as a network analysis tool and a comprehensive graph algorithm suite. The library integrates with Graphviz DOT for importing, exporting, and parsing graph data to facilitate visualization. It distinguishes itself by offering specialized network analysis capabilities, such as the detection of cliques, bridge edges, articulation points, and subgraph isomorphisms. Its computational surface covers a wide range of algorithms, includi

This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

SUMO is a microscopic traffic simulation suite designed to model the movement of individual vehicles and pedestrians across large-scale urban road networks. It functions as a multimodal transport simulator that integrates cars, pedestrians, bicycles, railways, and waterways within a single environment, supported by tools for road network generation and traffic demand modeling. The project distinguishes itself through specialized toolsets for environmental impact analysis, which calculate vehicle emissions and energy consumption for electric and hybrid fleets. It provides comprehensive capabil

This project is a Python collection of algorithms and data structures that implement the concepts from the Artificial Intelligence: A Modern Approach textbook. It serves as an educational resource for learning core artificial intelligence concepts through the implementation of classic algorithms for searching, logic, and problem solving. The repository functions as an automated reasoning toolset for managing knowledge bases, a game theory engine for calculating optimal moves in competitive games, and a search and optimization library. It provides specialized frameworks for deriving logical co

This project is a neural network route optimizer and unsupervised learning tool designed to solve the traveling salesman problem. It functions as a self-organizing map solver that calculates near-optimal paths through a set of coordinates to determine the shortest possible tour. The system utilizes a Kohonen map implementation to organize high-dimensional data into a lower-dimensional representation. It employs competitive learning and topology preservation to approximate solutions for combinatorial optimization problems. The solver covers route optimization analysis and heuristic pathfindin

algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I

This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas

This project is a curated reference library of algorithmic patterns, data structure implementations, and system design notes. It serves as a Java algorithmic problem set and a competitive programming guide, providing a collection of solutions for coding challenges from platforms like LeetCode and LintCode. The library is distinguished by its comprehensive set of Java implementations for advanced data structures and algorithmic strategies. It includes detailed references for solving complex problems with accompanying time and space complexity analysis. The project covers a broad surface of co

Kùzu is an embedded property graph database engine designed for high-performance analytical queries and local data management. It operates as a library within the host application process, utilizing a columnar-based storage architecture and just-in-time query compilation to execute complex graph traversals and pattern matching efficiently. By mapping database files directly into system memory, it ensures data durability and high-speed access while maintaining ACID-compliant transactional integrity. The engine distinguishes itself by integrating vector similarity search and full-text search di

scikit-opt is a Python optimization library and numerical framework designed to solve complex global optimization problems. It provides a suite of metaheuristic algorithms and tools for finding global minima or maxima of objective functions. The library implements a variety of nature-inspired and swarm intelligence algorithms, including Genetic Algorithms, Particle Swarm Optimization, Differential Evolution, Simulated Annealing, and Ant Colony Optimization. It includes specialized solvers for discrete combinatorial challenges, such as the Traveling Salesman Problem. The framework supports th