Daniel Ray's Blog

12 Jul 2020

The disjoint-set data structure is a data structure that represents set partitions. A set partition of a set S is a coll...

12 Jul 2020

Kruskal's algorithm is a popular algorithm for finding minimum spanning trees. Here is an outline of it: (1) Start with ...

12 Jul 2020

A minimum spanning tree of a weighted connected graph is a spanning tree whose weight is less than or equal to the weigh...

11 Jul 2020

In the vertex coloring problem, you are given a graph and a set of colors. You want to assign colors to the vertices of ...

11 Jul 2020

The N queens problem is a classic problem. It can be stated as follows: Place N queens on an NxN chessboard such that no...