MonusWeightedSearch.Internal.AdjList

Description

This module provides an implementation of weighted graphs as arrays of words. It's useful for generating random graphs, and performance testing.

Synopsis

Documentation

A graph with vertices labelled by words, and edges weighted by words.

Constructors

AdjList
Fields edges :: UArray (Word, Word) Word

Instances details

Eq AdjList Source #
Instance details Defined in MonusWeightedSearch.Internal.AdjList Methods (==) :: AdjList -> AdjList -> Bool # (/=) :: AdjList -> AdjList -> Bool #
Ord AdjList Source #
Instance details Defined in MonusWeightedSearch.Internal.AdjList Methods compare :: AdjList -> AdjList -> Ordering # (<) :: AdjList -> AdjList -> Bool # (<=) :: AdjList -> AdjList -> Bool # (>) :: AdjList -> AdjList -> Bool # (>=) :: AdjList -> AdjList -> Bool # max :: AdjList -> AdjList -> AdjList # min :: AdjList -> AdjList -> AdjList #
Show AdjList Source #
Instance details Defined in MonusWeightedSearch.Internal.AdjList Methods showsPrec :: Int -> AdjList -> ShowS # show :: AdjList -> String # showList :: [AdjList] -> ShowS #
Arbitrary AdjList Source #
Instance details Defined in MonusWeightedSearch.Internal.AdjList Methods arbitrary :: Gen AdjList # shrink :: AdjList -> [AdjList] #
NFData AdjList Source #
Instance details Defined in MonusWeightedSearch.Internal.AdjList Methods rnf :: AdjList -> () #

Arguments

Generate a random graph.

Return the number of vertices in the graph.

Convert an adjacency list to a standard graph.

Arguments

:: Word	The number of vertices in the graph.
-> Graph Word	The graph.
-> AdjList

Convert a graph to an adjacency list.