dijkstra_fast 1.4.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:
=
installation:
=
Dépendances de Development (9):
bundler
>= 0
rake
>= 0
rake-compiler
>= 0
rspec
>= 0
rubocop
>= 0
rubocop-rake
>= 0
rubocop-rspec
>= 0
simplecov
>= 0
yard
>= 0
Propriétaires:
Pushed by:
Auteurs:
-
David McCullars
Total de contrôle SHA 256:
=