contraction hierarchies
-
Updated
Apr 5, 2024 - Rust
contraction hierarchies
Analyzing the board game Ticket to Ride as an undirected graph for various problems
A small program to showcase what a «graph» typically refers to in computer science. It's also capable of finding the shortest path between two points.
An implementation of Dijkstra's algorithm in Rust.
Add a description, image, and links to the dijkstra-shortest-path topic page so that developers can more easily learn about it.
To associate your repository with the dijkstra-shortest-path topic, visit your repo's landing page and select "manage topics."