Data.Graph.Inductive.Internal.RootPath

fgl-5.8.3.0: Martin Erwig's Functional Graph Library

Safe Haskell | Safe-Inferred
Language | Haskell98

Data.Graph.Inductive.Internal.RootPath

Contents

- Types
- Operations

Description

Inward directed trees as lists of paths.

Synopsis

- type RTree = [Path]
- type LRTree a = [LPath a]
- getPath :: Node -> RTree -> Path
- getLPath :: Node -> LRTree a -> LPath a
- getDistance :: Node -> LRTree a -> Maybe a
- getLPathNodes :: Node -> LRTree a -> Path

# Types

type RTree = [Path] #

type LRTree a = [LPath a] #

# Operations

getPath :: Node -> RTree -> Path #

getLPath :: Node -> LRTree a -> LPath a #

getDistance :: 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.

getLPathNodes :: Node -> LRTree a -> Path #