NLP.Adict.Graph

Documentation

minPath :: (Show n, Show w, Ord n, Ord w, Num w, Fractional w) => w -> Edges n w -> IsEnd n -> n -> Maybe ([n], w)

Find shortes path from a beginning node to any ending node.

type Edges n w = n -> [(w, n)]

type IsEnd n = n -> Bool