| |||||||||
| |||||||||
| |||||||||
Description | |||||||||
Inward directed trees as lists of paths. | |||||||||
Synopsis | |||||||||
| |||||||||
Types | |||||||||
type RTree = [Path] | |||||||||
type LRTree a = [LPath a] | |||||||||
Operations | |||||||||
getPath :: Node -> RTree -> Path | |||||||||
getLPath :: Node -> LRTree a -> LPath a | |||||||||
getDistance :: Node -> LRTree a -> a | |||||||||
Produced by Haddock version 0.6 |