Search Results for "shortest path"
Sort By:
Showing 49 open source projects for "shortest path"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
Enterprise-grade ITSM, for every businessFreshservice 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.
-
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... -
2
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”. -
3
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. ... -
4
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. -
Find Hidden Risks in Windows Task SchedulerWindows Task Scheduler might be hiding critical failures. Download the free JAMS diagnostic tool to uncover problems before they impact production—get a color-coded risk report with clear remediation steps in minutes.
-
5
Curve Ensemble
Curve Ensemble, a tool to manage and create curves
... * 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. Usage is now fully documented in a 27-page manual, Curve_Ensemble_manual.pdf. -
6
Sokoban game for Windows including 8000 levels, 30 skins, level editor, undo/redo, save positions, replay.
-
7
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. -
8
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. -
9
AcoPath
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. -
Our Free Plans just got better! | Auth0You 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.
-
10
PsoPath
Particle Swarm 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 Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. -
11
MUD Map
A mapping tool for text-based games like text adventures, MUDs, etc.
MUD Map helps users of MUDs, MUSHs, text adventures and similar games at creating maps of the virtual worlds and to keep an overview over places, paths, dangerous areas,... This repository contains the code and binaries of MUD Map v1 (deprecated!) as well as the Java binaries (jar) of MUD Map v2. More information about MUD Map v2 can be found on GitHub: https://github.com/Neop/mudmap2 -
12
BioNet-Finder
Network-based modeling and analysis for complex biological data
...This is carried out applying network analysis methods from different fields, such as Structural Equation Modeling (SEM), together with data reduction algorithms (e.g., random walkers, spectral analysis, shortest path-based or topology-based algorithms). The BioNet-Finder project is at its initial steps, and it will continuously update with new methods and code. -
13
Shortest Path Graph A star
finds the sortest path on the directed graph using A* algorithm.
It is the implementation of the A* algorithm for directed graph. Additionally, the implementation of the Graph is provided. For visualization of the graph and the results of the A* algorithm the data are exported in GraphViz (Graph Visualization Software) format: http://www.graphviz.org/ Various exemplary solutions are provided. See also my other two projects related to A* algorithm: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/a-star/ -
14
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
15
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. ... -
16
Please cite our paper if you decide to use the code. The paper details are: Sibo Wang, Xiaokui Xiao, Yin Yang, Wenqing Lin. Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks. Proceedings of the VLDB Endowment (PVLDB), 10(2): 61-72, 2016. In this project, we included the source code (COLA_code.zip) and the datasets, query sets we used in the experiments (COLA_datasets.zip). To see the files in the project, click "Browse All Files" To complile $cd COLA_code/ $g++ cola.cpp -O3 -o cola -std=c++11 You may use preprocessing.batch script to do the preprocessing We have removed some datasets due to the size limitation of files in sourceforge. ...
-
17
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file.
-
18
A modeling and simulation tool for Routing problems on Graphs, tccrouter is a java desktop application that provides a 2d map for building graphs and simulating a variety of real world routing solutions: Shortest path, TSP, VRP, VRP-TW. Check Git repository. https://github.com/guilhebl/routerapp
-
19
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. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational... -
20
A educational Java software featuring a graph editor and algorithms animation to learn how the algorithms work. Algorithms: Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (Prim), Single-Source Shortest Path (Dijkstra), Maximum Flow (Edmonds-Karp).
-
21
Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.
-
22
CoGA
R package for differential co-expression analysis
...The software infers gene regulatory networks from gene expression data, and compares structural properties of the inferred networks based on their spectrum distributions. It also compares the networks in terms of their gene centralities, clustering coefficients and shortest path lengths. In addition to the differential co-expression analyses, the tool provides graphical interfaces for network visualization, ranking of genes according to their "importance" in the network, and the standard single gene differential expression analysis. -
23
Navigation Shortest Map Dhaval Kadia
Shortest Path Navigator with Directions and Distance
Programmed on Language C. A nano-Infant of GOOGLE-MAP Optimized to Consume some MB instead of 50 GB of RAM This was Programmed Quarter Year ago in 2014 -
24
EZreclaim
Reclaim space taken by duplicate files
Reclaim space taken by duplicate files. With the option of Deleting or replacing duplicate files with hard links. CAUTION : MAKE SURE YOU HAVE A BACKUP OF YOUR DATA BEFORE RUNNING THIS PROGRAM. NEVER RUN AGAINST SYSTEM FILES OR FOLDERS AS YOUR SYSTEM MAY BE PERMANENTLY DAMAGED. -
25
Maze Solver
Solves mazes
...Just drag and drop the text file into the program and select which algorithm you would like the program to use to solve the maze. Currently you can choose either the Recursive algorithm (which does not give you the shortest path) or the Breadth-first search algorithm (gives you the shortest path). Building requirements: You compiler needs to support C++ 11 if your compiling the C++ version. You compiler needs to support C99 if your compiling the C version.
