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: 129,089 of 198,774
Downloads: 5,408

Daily

Ranking: 40,441 of 198,739
Downloads: 3

Depended by

RankDownloadsName

Depends on

RankDownloadsName
13,972,983,480bundler
81,469,998,038rake
291,043,852,410rspec
55779,915,426rubocop
97521,925,948simplecov
179310,090,180rubocop-rspec
234243,536,630yard
396140,590,450redcarpet
1,07448,195,125rubocop-rake
1,45532,095,579rake-compiler
1,47531,130,516github-markup

Owners

#GravatarHandle
1iconDavid_McCullars