javascript-datastructures-algorithms - :books: collection of JavaScript data structures and algorithms for education purposes

•    Javascript

---

Source code of Learning JavaScript Data Structures and Algorithms book.

javascript-algorithms algorithm data-structures typescript typescript-algorithms stack queue deque priority-queue linked-list set tree sorting-algorithms dictionary binary-tree avl-tree quicksort graph graph-algorithms dijkstra-algorithm

SwiftGraph - A Graph Data Structure in Pure Swift

•    Swift

---

SwiftGraph is a pure Swift (no Cocoa) implementation of a graph data structure, appropriate for use on all platforms Swift supports (iOS, macOS, Linux, etc.). It includes support for weighted, unweighted, directed, and undirected graphs. It uses generics to abstract away both the type of the vertices, and the type of the weights. It includes copious in-source documentation, unit tests, as well as search functions for doing things like breadth-first search, depth-first search, and Dijkstra's algorithm. Further, it includes utility functions for topological sort, Jarnik's algorithm to find a minimum-spanning tree, detecting a DAG (directed-acyclic-graph), and enumerating all cycles.

graph data-structure graph-algorithms dijkstra-algorithm topological-sort breadth-first-search depth-first-search prims-algorithm

dijkstra - Fastest golang Dijkstra path finder

•    Go

---

Golangs fastest Dijkstra's shortest (and longest) path calculator, requires go 1.6 or above (for benchmarking). go test -bench .

graph dijkstra dijkstra-algorithm shortest-paths pathfinding

Advanced-Shortest-Paths-Algorithms - Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm

•    Java

---

Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code. Bi-Directional Dijsktra Algorithm: Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet in the middle. The reason for this approach is that in many cases it is faster.

shortest-paths graphs a-star dijkstra-algorithm bidirectional-dijkstra priority-queue tested verified contraction hierarchies algorithms reverse-graph shortest-path-routing-algorithm graph-algorithms bidirectional-dijkstra-algorithm contraction-hierarchies-algorithm astar-algorithm shortest-path-algorithm

unity-dijkstras-pathfinding - Dijkstra's Pathfinding Algorithm Unity Implementation.

•    CSharp

---

Dijkstra's Pathfinding Algorithm Unity Implementation. It is the implementation of Dijkstra's Pathfinding Algorithm in Unity (Game Engine) that let's you find the shortest path between two Nodes in a Graph.

pathfinding pathfinding-algorithm pathfinding-library algorithm implementation algorithm-library dijkstra dijkstra-algorithm dijkstra-shortest-path dijsktra-shortest-path unity unity3d unity2d unity-3d unity-scripts csharp-code csharp-library

ch - Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph

•    Go

---

This library provides Contraction Hierarchies preprocessing graph technique for Dijkstra's algorithm. Classic implementation of Dijkstra's algorithm, maneuver restrictions extension and isochrones estimation are included also.

graph osm pathfinding dijkstra isochrones shortest-paths breadth-first-search hacktoberfest dijkstra-algorithm shortest-path-algorithm isochrone-map contraction-hierarchies turn-restrictions