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,130 of 184,487
Downloads: 4,308

Daily

Ranking: 59,086 of 184,472
Downloads: 1

Depended by

RankDownloadsName

Depends on

RankDownloadsName
12,587,986,982bundler
101,011,350,820rake
26847,165,402rspec
62513,241,112rubocop
99369,941,717simplecov
196201,215,255rubocop-rspec
227168,042,997yard
40297,825,231redcarpet
1,22030,191,836github-markup
1,48421,164,666rubocop-rake
1,73715,131,604rake-compiler

Owners

#GravatarHandle
1iconDavid_McCullars