The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning. Learn more →
Top 15 dijkstra-algorithm Open-Source Projects
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
data-structure-typed
Javascript Data Structure & TypeScript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree, AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack.
-
FXGraphAlgorithmSimulator
Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
pairing_heap
Performant priority queue in pure Ruby with support for changing priority using pairing heap data structure
-
py-routes
Python recursive shortest path algo to find the optimal route between two points in terms of number of stops and duration
-
jetbrains-academy-hypermetro
Have you ever been worried about getting lost in the subway? Do you need to find a faster route to your destination? Write an application that will help you better navigate the complicated metro system.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
Actual Web Site
Project mention: Need help with a somewhat advanced maze-solving program | /r/gamemaker | 2023-05-12Sure! Best practise is probably creating a new script, called something like scr_dijkstra, which contains a function find_shortest_path(_input_grid, _starting_location, _target_location, _output_grid) which outputs the shortest path in the designated output grid. I'm currently at my work so I haven't got the time to go into it in-depth, but I will when I get home. You could check out this example from github to get an idea. For me it also helps a lot to look at the visualisation and algorithm as described on Wikipedia.
dijkstra-algorithm related posts
- Hacktoberfest is ON CXXGraph
- Revolutionizing Data Processing with CXXGraph: A Comprehensive Guide to Graph Data Structures in C++
- CXXGraph Library : Header-Only C++ Library for Graph Representation and Algorithms
- Code Review - Breadth First Shortest Path
-
GraphScope VS CXXGraph - a user suggested alternative
2 projects | 17 Mar 2022
-
euler VS CXXGraph - a user suggested alternative
2 projects | 17 Mar 2022
-
xgboost VS CXXGraph - a user suggested alternative
2 projects | 28 Feb 2022
-
A note from our sponsor - WorkOS
workos.com | 27 Apr 2024
Index
What are some of the best open-source dijkstra-algorithm projects? This list will help you:
Project | Stars | |
---|---|---|
1 | SwiftGraph | 733 |
2 | CXXGraph | 393 |
3 | Pathfinding | 299 |
4 | Dijkstra.NET | 109 |
5 | cppRouting | 97 |
6 | data-structure-typed | 80 |
7 | FXGraphAlgorithmSimulator | 52 |
8 | pairing_heap | 17 |
9 | Competitive-Python | 15 |
10 | py-routes | 8 |
11 | Path-finder | 7 |
12 | graph-pathfinding-algorithms | 5 |
13 | dijkstra | 1 |
14 | jetbrains-academy-hypermetro | 0 |
15 | pathfinding-music | 0 |
Sponsored