Modulefgl-5.8.3.1Haskell98

Data.Graph.Inductive.Internal.RootPath

Inward directed trees as lists of paths.

Types

2 declarations

typetype RTree = [Path]

typetype LRTree a = [LPath a]

4 declarations

valuegetPath :: Node -> RTree -> Path

valuegetLPath :: Node -> LRTree a -> LPath a

valuegetDistance :: Node -> LRTree a -> Maybe a

Return the distance to the given node in the given tree.

Returns Nothing if the given node is not reachable.

valuegetLPathNodes :: Node -> LRTree a -> Path