fgl-5.7.0.3: 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] Source #

type LRTree a = [LPath a] Source #

Operations

getPath :: Node -> RTree -> Path Source #

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

getDistance :: Node -> LRTree a -> Maybe a Source #

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 Source #