Category: Haskell

Undirected Graphs

Data structures capture relationship between the component values such as succession or relative magnitude. Graphs data structure is a very general representation of binary relations recorded as edges between a collection of vertices. There are many variations and extensions of graphs such as labelled vertices, labelled edges, root verities, multi-edges etc. However, in this article

Continue Reading

Sets - Purely Functional Data Structures

A set is one of the most fundamental data structure. It allows to keep a unique, unordered enumeration of elements. Ordered Lists We could use an ordered list to implement a set data structure.

The problem: these are still linear. Binary Trees Sets can be implemented using the list as the underlying data structure,

Continue Reading