Categories: None [Edit]

dijkstra_fast

https://rubygems.org/gems/dijkstra_fast
https://github.com/david-mccullars/dijkstra_fast
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.

Total

Ranking: 132,142 of 184,512
Downloads: 4,308

Daily

Ranking: 54,789 of 184,502
Downloads: 0

Depended by

RankDownloadsName

Depends on

RankDownloadsName
12,589,739,117bundler
101,012,059,501rake
26847,554,731rspec
62513,707,047rubocop
99370,212,271simplecov
196201,419,688rubocop-rspec
227168,163,875yard
40297,883,480redcarpet
1,22330,194,105github-markup
1,48421,202,690rubocop-rake
1,73515,155,645rake-compiler

Owners

#GravatarHandle
1iconDavid_McCullars