6 repositorios
Algorithms for finding the most efficient paths in graphs using costs or distance weights.
Distinct from Path Optimization Algorithms: Focuses on weighted graph traversal for efficiency, unlike general algorithmic sequence optimization.
Explore 6 awesome GitHub repositories matching education & learning resources · Weighted Graph Path Optimizations. Refine with filters or upvote what's useful.
PathPlanning is a library of animated path planning algorithms that includes implementations of A-star, Dijkstra, RRT, and spline-based trajectory generation for both 2D and 3D environments. The project provides a collection of motion planning algorithms that demonstrate how robots can find collision-free paths through continuous spaces, with each algorithm rendered as a step-by-step visual animation to show how the search or tree grows over time. The library covers three main categories of path planning: sampling-based methods like RRT, RRT-star, and BIT-star that grow trees by randomly samp
Implements Dijkstra's algorithm for computing shortest paths in weighted graphs.
PathFinding.js is a grid-based pathfinding library that implements multiple search algorithms for computing optimal routes on 2D maps. It provides implementations of A*, Dijkstra, Breadth-First Search, and Jump Point Search, each designed to find the shortest path between two points on a grid while avoiding obstacles. The library is built around a pluggable architecture where each pathfinding strategy shares a common interface, allowing algorithms to be selected at runtime without modifying core logic. It includes a configurable diagonal movement rule engine that controls diagonal traversal b
Implements Dijkstra's algorithm for finding shortest paths on weighted or unweighted grids.
This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal
Implements Dijkstra's algorithm to find the most efficient path between nodes in a weighted graph.
AlgorithmsByPython es una biblioteca de referencia y repositorio educativo que proporciona implementaciones ejecutables en Python de fundamentos de ciencias de la computación. Sirve como una guía completa para patrones algorítmicos, estructuras de datos centrales y soluciones para programación competitiva y desafíos de entrevistas técnicas. El proyecto se distingue por ofrecer una amplia gama de implementaciones de referencia, incluyendo un conjunto dedicado de soluciones para problemas comunes de LeetCode. Se centra en traducir la lógica computacional teórica en código Python práctico para uso educativo y profesional. El repositorio cubre una amplia gama de capacidades, incluyendo el diseño de colecciones lineales, árboles y grafos, así como la implementación de estrategias de búsqueda y ordenamiento. Incluye utilidades para teoría de grafos, como cálculos de camino más corto y árbol de expansión mínima, y proporciona mecanismos para indexación de disco y coincidencia de patrones de texto.
Calculates minimum distances in weighted graphs using greedy selection and distance relaxation techniques.
FalkorDB is a high-performance graph database management system and vector graph database. It serves as a knowledge graph construction tool and a GraphRAG knowledge store, integrating structured property graphs with vector search to provide grounded context for large language models. The engine is designed as a multi-tenant graph engine, capable of hosting thousands of isolated datasets within a single instance. The system distinguishes itself by using linear algebra for query execution, treating relationship tensors as matrix multiplications to achieve low-latency multi-hop traversals. It ut
Provides capabilities to find the most efficient paths between nodes using distance or cost weights.
This project is a comprehensive computer networking textbook and instructional resource. It serves as a technical guide for the design and implementation of network layers, protocols, and hardware architecture, covering the spectrum from physical links to application-layer protocols. The content provides a detailed study of standards for congestion control, reliable data delivery, and internetwork routing. It includes specialized technical material on network security, public-key infrastructure, and the operation of modern cloud infrastructure and data centers. The material covers a broad ra
Implements distance-vector and link-state routing algorithms to calculate the most efficient paths in weighted network graphs.