RubyGems Navigation menu

dijkstra_fast 1.5.3

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.

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)

Owners:

Pushed by:

Authors:

  • David McCullars

SHA 256 checksum:

55b38c1edc9f7650e9c497ba0ee033dc737588097adb7336242b9d39ee2773a7

Total downloads 1,867

For this version 618

Gemfile:
= Copy to clipboard Copied!

install:
=

License:

MIT

Required Ruby Version: >= 3.0.0

Requires MFA accounts: true

Links: