Search Results for "path-setting"
Sort By:
Showing 33 open source projects for "path-setting"
View related business solutions-
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.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
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. -
2
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... -
3
JCTools
Java Concurrency Tools for the JVM
...JCTools is also used by commercial products with great results. JCTools is maven built and requires an existing Maven installation and JDK8 (only for building, runtime is 1.6 compliant). With ‘MAVEN_HOME/bin’ on the path and JDK8 set to your ‘JAVA_HOME’ you should be able to run “mvn install” from this directory. While you are free to copy & extend JCTools, we would much prefer it if you have a versioned dependency on JCTools to enable better support, upgrade paths and discussion. -
4
Activation Key .NET Class Library
Represents the activation key used to protect your C# application.
A specific software-based key for a computer program C# source code. It certifies that the copy of the program is original. It is also called a license key, product key, product activation, software key and even a serial number. The key can be stored as a human readable text for easy transfering to the end user. Contains methods for generating the cryptography key based on the specified hardware and software binding. An additional feature is the ability to embed any information directly... -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
Control logic
Realtime PC-based control and simulator of control systems
Control logic Java package is a set of Java classes aimed at: - Implementation of a real-time PC-based control - Simulation of control systems Setting up a control system involves working with so-called triggers. See project Wiki for detailed information and examples. -
6
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. It is accessible to learners at different levels, from beginners to more advanced users who want to reinforce their knowledge. ... -
7
Binarytree
Python library for studying Binary Trees
Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms. -
8
SAP CL_SALV_TABLE with editable fields
SAP ABAP CL_SALV_TABLE class with editable fields
Hi everybody! I've developed a local SAP ABAP class capable of setting any field of a CL_SALV_TABLE object ready for input. I named it LCL_SALV_BUDDY. To use it go to the FILES tab and download the LCL_SALV_BUDDY README.TXT file with instructions, the LCL_SALV_BUDDY.TXT file with the class source code and file LCL_SALV_BUDDY EXAMPLE.TXT with a working example using an ALV, both FULLSCREEN and also inside a CONTAINER. -
9
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
10
interactive-coding-challenges
120+ interactive Python coding interview challenges
...Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas. -
11
jsprit
Open source toolkit for solving rich vehicle routing problems
jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design and a comprehensive set of unit and integration tests. Possibility to define additional stateless and stateful constraints/conditions to account for the richness of your problem. ... -
12
PythonRobotics
Python sample codes and textbook for robotics algorithms
PythonRobotics is a Python code collection and textbook for learning robotics algorithms through readable examples. It covers practical topics such as localization, mapping, path planning, path tracking, control, SLAM, and autonomous navigation. The project is written to make each algorithm’s core idea easy to understand, rather than hiding the logic behind large frameworks. It keeps dependencies minimal so learners can focus on the math, implementation, and behavior of each robotics method. Visual examples and simulations help users see how algorithms move, estimate, plan, and react. ... -
13
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. ... -
14
The Edge Machine Learning library
Machine learning algorithms for edge devices
Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One instance of where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.These algorithms can train models for classical supervised learning problems with memory requirements that are orders of magnitude lower than other modern ML algorithms. The trained models can be loaded onto edge devices such as IoT devices/sensors, and used to make fast and accurate predictions completely offline. ... -
15
CoRoPa stands for Computational Rough Paths. The aim of CoRoPa is to provide a software framework for various ideas related to Rough Path Theory, including rough differential equations and the digital description of serial data streams.
-
16
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... -
17
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 -
18
ImpPath
Simple C++ library for path manipulation
Very basic path manipulation library. Aims to be simple, intuitive and predictable (not universal). Works with std::string and std::wstring. Configurable to support both POSIX and Windows paths (drive letters only - no schemas, network paths etc), as well as some custom formats (with limitations for simplicity). All configurations understand ".." -
19
php-url-extractor
List al URLs present in requested URL in absolute format
This php program extracts all URLs present on the requested URL, in absolute path. -
20
-
21
-
22
All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.
-
23
Graphserver provides fast shortest-path computations on very large graphs, for use as a sub-component of a trip-planning service.
-
24
In this project we develop a software, that uses evolutionary algorithm to evolve a solution, that can drive a car on an arbitrari path.
-
25
The better path to work with Delphi and DBX components. The DbExpress is very powerfull but with high level dificulty to use. The devDivision create this component to yours. http://www.4shared.com/file/102259176/bc19d4e/dddbxfacil.html