Search Results for "k shortest paths"
Sort By:
Showing 25 open source projects for "k shortest paths"
View related business solutions-
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.
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
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
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,... -
3
Canvas LMS
The open LMS by Instructure, Inc.
Canvas LMS is a full-featured learning management system designed for K–12, higher-ed, and professional training, with a strong emphasis on usability and openness. Instructors build courses from modular content—pages, assignments, discussions, quizzes—and organize them into learning paths with prerequisites and due dates. Rich grading tools like SpeedGrader streamline assessment with rubrics, inline annotations, and audio/video feedback, while the gradebook supports weighting, outcomes, and late/missing policies. ... -
4
Kubie
A more powerful alternative to kubectx and kubens
kubie is an alternative to kubectx, kubens, and the k on prompt modification script. It offers context switching, namespace switching, and prompt modification in a way that makes each shell independent from others. It also has support for split configuration files, meaning it can load Kubernetes contexts from multiple files. You can configure the paths where Kubie will look for contexts, see the settings section. -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
5
...Generate KPOINTS, POTCAR and INCAR for a given POSCAR file; 2. Elastic-constants using stress-strain or energy-strain methods; 3. Equation-of-state fitting; 4. Suggested k-paths for a given crystal structure; 5. Optical adsorption coefficient; 6. Band structure unfolding; 7. Fermi surface; 8. Density-of-states and band-structure; 9. Charge/spin density, Charge density difference; 10. Vacuum level and work function; 11. Wave-function analysis; 12. Molecular-dynamics analysis; 13. Effective mass of carrier; 14. ...
-
6
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. -
7
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. -
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
Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).
-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
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 -
11
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... -
12
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. The program was written in C++ using a main algorithm of a heap sorting. In this program, specifically users the codes for minimum heap since the purpose of the program is to find the minimum cost or path.
-
13
GenNet
A Tool for Qualitative and Quantitative Modeling of Gene Regulatory Ne
A Tool for Qualitative and Quantitative Modeling of Gene Regulatory Networks. GenNet is a Java based tool called that facilitate the model checking user by providing a unique GUI layout for both qualitative and quantitative modeling of GRNs. GenNet also assists the modeling users by providing some extra features i.e. CTL editor, parameters filtering and input/output files management. Download pre-installed GenNet Virtual Box Image here... -
14
SEM_bestShortestPath
A SEM-based method for disease module detection
SEM_bestShortestPath is a Structural Equation Modeling (SEM)-based methodology to evaluate the most important shortest paths between differentially expressed genes in biological interaction networks, with absolutely no need of user-defined parameters or heuristic rules, enabling a free-of-bias discovery and overcoming common issues affecting recent network-based algorithms. SEM-bsp is based on Structural Equation Modeling techniques to detect significantly perturbed sub-networks (disease modules) from microarray data, relevant for the disease phenotype under investigation. -
15
APS SLC Layout
Evaluation of APS accessibility in downtown Salt Lake City
...The effectiveness of these signals, however, is potentially undermined by their placement if planning considerations do not maximize their use. One hundred and twelve blocks of the downtown Salt Lake City area were inventoried in the months of November and December of 2013. Over 500 possible paths were then measured and compared to the shortest possible paths to determine the area's connectivity. -
16
GAuditor - The Graph Auditor Tool
A graph theory software for academic purposes
GAuditor is a software for use by students of graph theory. It helps solving problems like discovering the shortest paths from a single source vertex using Algorithyms like Dijkstra, Bellman-Ford and Floyd-Warshall, cycle detection, Eulerian circuit, Hamiltonian cycle, conectivity inspection, Breadth First Search, Depth First Search, etc. -
17
C# OO Implementation of Dijkstra's algorithm aimed at finding the path with the minimum cost. It now supports finding the shortest paths from the source vertex to every other vertex. The C# source files are now available.
-
18
MuLaViTo
A framework for the visualization of multi-layer networks
MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ... -
19
Open Source Routing Machine computes shortest paths in a graph. It was designed to run well with map data from the Openstreetmap Project.
-
20
Graphz is a library for manipulating graph data structures. Graphz can be analyzed, using algorithms, such as shortest paths etc. Graphz is written in Java. It is compatible with GWT and can run in the browser as well.
-
21
The implementations of finding the k shortest paths (KSP) algorithm. A C/C++ library including some classical graph relative algorithm implementations.
-
22
MMOpenGraph is a set of JAVA-Classes to represent graphs within java. It can load and save graphs to serialized or text-based files and analyze graphs to find shortest paths.
-
23
The Graph Implementation and Representation Libraries, or GIRLs, aim to be all-purpose libraries for solving graph theory problems. ie, shortest paths, matching, cycles, connectedness, creating 'random' graphs, etc...
-
24
this is a project for the computer vision class. We intend to track multi-targets while preserving the identity of the targets. We propose to represent this as a Flow optimization problem and solve it using K-shortest path algorithm.
-
25
CASSANDRAOSGi
OSGI CASSANDRA CUSTOMIZATION
CASSANDRA is then based on a run-time checking algorithm that takes in input the interface automata for the various components, the look-ahead value 𝑘, the temporal property that should not be violated by the system: The interface automata of the various components are composed on the fly to construct the tree of possible paths of length smaller than k, When a system interaction event is detected the exploration is moved ahead of one step. In particular: All the subtrees rooted in a next state linked by an event different from the one detected are discarded; For each leaf in the subtree rooted in the next state linked by the detected event, the exploration is pushed ahead of one step; We customize CASSANDRA into the OSGi component model and framework. ...
- Previous
- You're on page 1
- Next
