Search Results for "shortest path algorithm"
Sort By:
Showing 125 open source projects for "shortest path algorithm"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Build Agents and Models on One PlatformGemini 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.
-
1
ngraph.path
Path finding in a graph
ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. ... -
2
Grey Wolf Optimizer for Path Planning
Grey Wolf Optimizer (GWO) path planning/trajectory
The Grey Wolf Optimizer for Path Planning is a MATLAB-based implementation of the Grey Wolf Optimizer (GWO) algorithm designed for UAV path and trajectory planning. It allows simulation of both two-dimensional and three-dimensional UAV trajectory planning depending on parameter setups. The tool provides built-in functions to configure different UAV environments and supports multiple optimization objectives. -
3
KACTL
KTH algorithm competition template library
KACTL (the KTH Algorithmic Contest Template Library) is an extensively curated and high-performance C++ algorithms library created by the competitive programming team at the Royal Institute of Technology (KTH) to serve as a trusted, battle-tested codebase for algorithmic contests, programming competitions, and general algorithm development. The repository aggregates dozens of concise implementations of essential data structures, numerical methods, graph algorithms, string processing tools,... -
4
NetworkX
Network analysis in Python
...Open source 3-clause BSD license. Well tested with over 90% code coverage. Additional benefits from Python include fast prototyping, easy to teach, and multi-platform. Find the shortest path between two nodes in an undirected graph. Python’s None object is not allowed to be used as a node. It determines whether optional function arguments have been assigned in many functions. And it can be used as a sentinel object meaning “not a node”. -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
LeetCode Master
About "Code Thoughts" LeetCode Practice Guide: 200 classic questions
...Each solution is accompanied by clear commentary to explain the thought process, algorithm design, and complexity analysis. The project is continuously updated and widely used by learners as both a reference and a roadmap to progress from beginner to advanced LeetCode practice. With its thorough coverage and educational style, leetcode-master helps programmers build strong problem-solving skills and confidence for competitive programming. -
6
Habitat-Sim
A flexible, high-performance 3D simulator for Embodied AI research
...It offers GPU-accelerated rendering and a flexible sensor suite—RGB, depth, semantic segmentation, and more—so agents can perceive and act in realistic scenes. The engine is written in C++ with Python bindings and integrates physics, navigation meshes, and shortest-path planners to support tasks like point-goal navigation, rearrangement, and interactive manipulation. It ships with connectors to popular datasets and scene formats, plus tools for dataset generation and scene replay. Determinism and reproducibility are first-class goals, which is critical for benchmarking agents and comparing algorithms. ... -
7
FFsubsync
Automagically synchronize subtitles with video
Language-agnostic automatic synchronization of subtitles with video, so that subtitles are aligned to the correct starting point within the video. First, make sure ffmpeg is installed. Make sure ffmpeg is on your path and can be referenced from the command line! Next, grab the script. It should work with both Python 2 and Python 3. There may be occasions where you have a correctly synchronized srt file in a language you are unfamiliar with, as well as an unsynchronized srt file in your... -
8
Jimp
An image processing library written entirely in JavaScript for Node
An image processing library for Node written entirely in JavaScript, with zero native dependencies. If you're using this library with TypeScript the method of importing slightly differs from JavaScript. Instead of using require, you must import it with ES6 default import scheme. If you're using a web bundles (webpack, rollup, parcel) you can benefit from using the module build of jimp. Using the module build will allow your bundler to understand your code better and exclude things you aren't... -
9
CodeGuide
This repository is a collection of the author, Xiao Fuge
CodeGuide is a curated collection of Java development resources built from years of real-world engineering experience by the author, who has worked extensively in large-scale internet companies. The project serves as a structured and comprehensive learning path for developers who want to strengthen their understanding of Java fundamentals and core programming practices. It includes detailed explanations of design patterns, source code analysis, frameworks, algorithms, and real-world project... -
MongoDB Atlas runs apps anywhereMongoDB 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.
-
10
hasher
Multi-algorithm hash tool (27 algorithms, checksum verify).
Usage: hasher [OPTIONS] <input> [<input2> ...] [algorithm] Multiple inputs are processed by a fixed worker pool (--threads). <input> : string or file path (use --file/--string to disambiguate). algorithm : md4, md5, md5-sha1, sha1, sha224, sha256, sha384, sha512, sha512-224, sha512-256, sha3-224, sha3-256, sha3-384, sha3-512, shake128, shake256, blake2b512, blake2s256, ripemd160, sm3, whirlpool, mdc2, keccak224, keccak256, keccak384, keccak512, blake3 -
11
GeoTools, the Java GIS toolkit
Toolkit for working with and mapping geospatial data
GeoTools is an open source (LGPL) Java code library which provides standards compliant methods for the manipulation of geospatial data. GeoTools is an Open Source Geospatial Foundation project. The GeoTools library data structures are based on Open Geospatial Consortium (OGC) specifications. -
12
Real-ESRGAN GUI
Cross-platform GUI for image upscaler Real-ESRGAN
...Real-ESRGAN can only enlarge the input image with a fixed 2-4x magnification (related to the selected model). This functionality is achieved by downsampling using a conventional scaling algorithm after multiple calls to Real-ESRGAN. Split each frame of the GIF and record the duration, zoom in one by one and then merge. Drag an image file or directory to any position in the window, and its path can be automatically set as the input. -
13
HiPS : Hierarchical Petri net Simulator
HiPS tool features to design and analyze hierarchical Petri nets
HiPS tool is developed at the Department of Computer Science and Engineering, Shinshu University, which is a tool design and analysis of Petri nets, developed using Microsoft Visual C # and C++. HiPS tool has a way of intuitive GUI which enable hierarchical and/or timed-net design. HiPS tool has also functions of static/dynamic analysis : T-invariant detection, Reachability path analysis, deadlock state detection, and k-boundedness analysis. In addition, it is possible to perform a random... -
14
Machine Learning for Software Engineers
A complete daily plan for studying to become a machine learning engine
Machine Learning for Software Engineers is an open-source learning roadmap designed to help software engineers transition into machine learning roles through a structured, practical study plan. The repository presents a top-down learning path that emphasizes hands-on experience rather than heavy theoretical prerequisites, making it particularly approachable for developers who already have programming experience but limited formal training in machine learning. The project organizes a multi-month study schedule that covers topics such as machine learning fundamentals, algorithm understanding, data preparation, and practical experimentation. ... -
15
C++ Complex Calculator
C++ complex calculator with arrays, matrices, eigenvectors, functions
This is a command line C++ code which compiles and links using gnu g++. It has scientific notation, scientific functions, complex integration including path integrals, and loops with tests. User defined functions are strings. A variable may simultaneously represent a scalar, an array, and a string. Arrays up to ten dimensions are allowed. Householder reduction is used for determinants, eigenvectors, and QR matrix factorization. Class Matrix and class Polynomial facilitate finding... -
16
JVerifier An hash code verifier JVerifier is a command line application that verify checksums from a GNU-style file. Source code available on https://github.com/davidesestiliwork/JVerifier2 Usage: param 1: file name, param 2: algorithm, param 3: baseDir Example: java -jar JVerifier2.jar SHA1SUMS SHA-1 /home/davide Note: this program requires GnuPG to work properly.
-
17
hello-algorithm
Algorithm training for Xiaobai
hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. -
18
Curve Ensemble
Curve Ensemble, a tool to manage and create curves
...The primary focus is on minimal energy curves, and our implimentation includes (Restricted) Elastic Splines as well as several methods related to parametric cubic splines. For each minimal energy curve method the following features are available: * Robust algorithm to find minimal energy interpolating curve. * Flexible node specifications (regular, clamped, free, data ball). * Multiple curves on the same canvas. * Transformation tools (translate, rotate, scale). * Elaborate painting capabilities. There are also other useful methods implemented, like Lines, Circles and DataBalls, and tools for subdivision and shortest/smoothest path through data balls. ... -
19
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. Usage from command line is also possible but with reduced flexibility (cf. ... -
20
Sokoban game for Windows including 8000 levels, 30 skins, level editor, undo/redo, save positions, replay.
-
21
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
22
dupeGuru
Find duplicate files
dupeGuru is a cross-platform GUI application written in Python (with Qt/Cocoa UI) that quickly detects duplicate files on your computer using flexible scanning modes—including filename fuzzy matching, content comparison, and specialized Music/Picture modes. On some linux systems pyrcc5 is not put on the path when installing python3-pyqt5, this will cause some issues with the resource files (and icons). These systems should have a respective pyqt5-dev-tools package, which should also be... -
23
Dragonbox
Reference implementation of Dragonbox in C++
This library is a reference implementation of Dragonbox in C++. Dragonbox is a float-to-string conversion algorithm based on a beautiful algorithm Schubfach, developed by Raffaello Giulietti in 2017-2018. Dragonbox is further inspired by Grisu and Grisu-Exact. Dragonbox generates a pair of integers from a floating-point number: the decimal significand and the decimal exponent of the input floating-point number. These integers can then be used for string generation of the decimal... -
24
Machine-Learning
kNN, decision tree, Bayesian, logistic regression, SVM
Machine-Learning is a repository focused on practical machine learning implementations in Python, covering classic algorithms like k-Nearest Neighbors, decision trees, naive Bayes, logistic regression, support vector machines, linear and tree-based regressions, and likely corresponding code examples and documentation. It targets learners or practitioners who want to understand and implement ML algorithms from scratch or via standard libraries, gaining hands-on experience rather than relying... -
25
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states.
