| |||||
| |||||
Description | |||||
An efficient implementation of Graph using big-endian patricia tree (i.e. Data.IntMap). This module provides the following specialised functions to gain more performance, using GHC's RULES pragma: | |||||
Documentation | |||||
| |||||
| |||||
| |||||
Produced by Haddock version 2.4.2 |