RubyGems Navigation menu

dijkstra_fast 1.5.2

Native implementation of Dijkstra algorithm for finding the shortest path between two vertices in a large, sparse graphs. Underlying algorithm is implemented in C using a priority queue. Edges are represented using linked lists rather than an adjacency matrix to reduce memory footprint when operating on very large graphs where the average number of edges between nodes is relatively small (e.g. < 1/10 the number of nodes). See https://en.wikipedia.org/wiki/Dijkstra's_algorithm for additional information.

Gemfile:
= Copy to clipboard Copied!

install:
=

Versions:

  1. 1.5.3 - January 04, 2022 (17.5 KB)
  2. 1.5.2 - January 04, 2022 (17 KB)
  3. 1.4.2 - December 23, 2021 (14.5 KB)

Development Dependencies (11):

bundler >= 0
rake >= 0
redcarpet >= 0
rspec >= 0
rubocop >= 0
simplecov >= 0
yard >= 0

Owners:

Pushed by:

Authors:

  • David McCullars

SHA 256 checksum:

= Copy to clipboard Copied!

Total downloads 3,964

For this version 1,026

License:

MIT

Required Ruby Version: >= 3.0.0

New versions require MFA: true

Version published with MFA: true

Links: