<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!--Rendered using the Haskell Html Library v0.2-->
<HTML
><HEAD
><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8"
><TITLE
>Data.Graph.Inductive.Internal.RootPath</TITLE
><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css"
><SCRIPT SRC="haddock-util.js" TYPE="text/javascript"
></SCRIPT
><SCRIPT TYPE="text/javascript"
>window.onload = function () {setSynopsis("mini_Data-Graph-Inductive-Internal-RootPath.html")};</SCRIPT
></HEAD
><BODY
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="topbar"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD
><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" "
></TD
><TD CLASS="title"
>fgl-5.4.2.3: Martin Erwig's Functional Graph Library</TD
><TD CLASS="topbut"
><A HREF="index.html"
>Contents</A
></TD
><TD CLASS="topbut"
><A HREF="doc-index.html"
>Index</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="modulebar"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD
><FONT SIZE="6"
>Data.Graph.Inductive.Internal.RootPath</FONT
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="section4"
><B
>Contents</B
></TD
></TR
><TR
><TD
><DL
><DT
><A HREF="#1"
>Types
</A
></DT
><DT
><A HREF="#2"
>Operations
</A
></DT
></DL
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
>Inward directed trees as lists of paths.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Synopsis</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A HREF="#t%3ARTree"
>RTree</A
> = [<A HREF="Data-Graph-Inductive-Graph.html#t%3APath"
>Path</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A HREF="#t%3ALRTree"
>LRTree</A
> a = [<A HREF="Data-Graph-Inductive-Graph.html#t%3ALPath"
>LPath</A
> a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgetPath"
>getPath</A
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ARTree"
>RTree</A
> -> <A HREF="Data-Graph-Inductive-Graph.html#t%3APath"
>Path</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgetLPath"
>getLPath</A
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> a -> <A HREF="Data-Graph-Inductive-Graph.html#t%3ALPath"
>LPath</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgetDistance"
>getDistance</A
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> a -> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgetLPathNodes"
>getLPathNodes</A
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> a -> <A HREF="Data-Graph-Inductive-Graph.html#t%3APath"
>Path</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="1"
><A NAME="1"
>Types
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A NAME="t:RTree"
><A NAME="t%3ARTree"
></A
></A
><B
>RTree</B
> = [<A HREF="Data-Graph-Inductive-Graph.html#t%3APath"
>Path</A
>]</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A NAME="t:LRTree"
><A NAME="t%3ALRTree"
></A
></A
><B
>LRTree</B
> a = [<A HREF="Data-Graph-Inductive-Graph.html#t%3ALPath"
>LPath</A
> a]</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="2"
><A NAME="2"
>Operations
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:getPath"
><A NAME="v%3AgetPath"
></A
></A
><B
>getPath</B
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ARTree"
>RTree</A
> -> <A HREF="Data-Graph-Inductive-Graph.html#t%3APath"
>Path</A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:getLPath"
><A NAME="v%3AgetLPath"
></A
></A
><B
>getLPath</B
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> a -> <A HREF="Data-Graph-Inductive-Graph.html#t%3ALPath"
>LPath</A
> a</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:getDistance"
><A NAME="v%3AgetDistance"
></A
></A
><B
>getDistance</B
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> a -> a</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:getLPathNodes"
><A NAME="v%3AgetLPathNodes"
></A
></A
><B
>getLPathNodes</B
> :: <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> a -> <A HREF="Data-Graph-Inductive-Graph.html#t%3APath"
>Path</A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="botbar"
>Produced by <A HREF="http://www.haskell.org/haddock/"
>Haddock</A
> version 2.6.1</TD
></TR
></TABLE
></BODY
></HTML
>
