Data.Named.Graph

Implementation of a graph with each internal node identified by a unique key and each leaf represented by a position in the sentence.

Documentation

data Graph n w

A graph over a sentence.

Constructors

Graph

Fields

• bounds :: (w, w)
• edgeMap :: Map n [Either n w]

mkGraph :: (Ord n, Ix w) => (w, w) -> [(n, [Either n w])] -> Graph n w

Make a graph given the bounds and list of edges.

edges :: Ord n => Graph n w -> n -> [Either n w]

Get keys of adjacent nodes for the given node key.

roots :: Ord n => Graph n w -> [n]

Return all graph roots (i.e. nodes with no parents).

toForest :: (Ord n, Ix w) => Graph n w -> NeForest n w

Transform a graph into a disjoint forest, i.e. a forest with no mutually overlapping trees. The process is lossy, discontinuity and overlapping cannot be represented with the NeForest data type.