Data.Matroid

This module provides type classes and functionalities that allow you to work with matroids and related structures.

A matroid is also called a combinatorial pre-geometry and is a structure that abstracts (linear) dependence. Matroids occur naturally in settings where the greedy algorithm works, although they usually stay under the radar.

Documentation

module Data.Matroid.Typeclass

module Data.Matroid.Uniform

module Data.Matroid.Graphic

module Data.Matroid.Ops

fromRk

Arguments

:: Show a

=> Set a

ground set

-> (Set a -> Int)

rank function

-> RkMatroid a

matroid constructor given groundset and rank function

namedFromRk

Arguments

:: String

name

-> Set a

ground set

-> (Set a -> Int)

rank function

-> RkMatroid a

named matroid constructor given groundset and rank function

fromIndep

Arguments

:: Show a

=> Set a

ground set

-> (Set a -> Bool)

independence test

-> IndepMatroid a

matroid constructor given groundset and test for independence

namedFromIndep

Arguments

:: String

name

-> Set a

ground set

-> (Set a -> Bool)

independence test

-> IndepMatroid a

named matroid constructor given groundset and test for independence

fromBasisFilter

Arguments

:: Show a

=> Set a

ground set

-> (Set a -> Set a)

returns maximal independent subset

-> BasisFilterMatroid a

matroid constructor given groundset and set-basis filter

namedFromBasisFilter

Arguments

:: String

name

-> Set a

ground set

-> (Set a -> Set a)

returns maximal independent subset

-> BasisFilterMatroid a

named matroid constructor given groundset and set-basis filter