RubyFlow The Ruby and Rails community linklog

Exploring a weighted quick find union algorithm in Ruby

In this article I explore the weighted quick find union algorithm in Ruby. This is an algorithm useful to finding out whether node A is connected to node B. Think of a maze: Is there a solution from the start to the finish? Or a network: Can computer A speak to computer B.

Post a comment

You can use basic HTML markup (e.g. <a>) or Markdown.

As you are not logged in, you will be
directed via GitHub to signup or sign in