ismo1 / ruby_dijkstra_algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A Ruby implementation of the Dijkstra's algorithm for pathfinding.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
README.md		README.md
dijkstra_algorithm.rb		dijkstra_algorithm.rb
graph.rb		graph.rb
node.rb		node.rb
test.rb		test.rb

Repository files navigation

Ruby implementation of Dijkstra's algorithm

This is an implementation of Dijkstra's algorithm. It can be used to determine the shortest path between two nodes in a graph.

Notes

This implementation has been written with non-oriented graphs in mind.
Nodes can and nodes can virtually be anything (despite I use a structure).

About

A Ruby implementation of the Dijkstra's algorithm for pathfinding.

Report repository

Releases

No releases published

Packages

No packages published