<!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.Query.SP</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-Query-SP.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.Query.SP</FONT
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></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"
><A HREF="#v%3AspTree"
>spTree</A
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> gr a b -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> b</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AspLength"
>spLength</A
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> gr a b -> b</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asp"
>sp</A
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> gr a b -> <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%3Adijkstra"
>dijkstra</A
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Internal-Heap.html#t%3AHeap"
>Heap</A
> b (<A HREF="Data-Graph-Inductive-Graph.html#t%3ALPath"
>LPath</A
> b) -> gr a b -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> b</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Documentation</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:spTree"
><A NAME="v%3AspTree"
></A
></A
><B
>spTree</B
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> gr a b -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> b</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:spLength"
><A NAME="v%3AspLength"
></A
></A
><B
>spLength</B
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> gr a b -> b</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:sp"
><A NAME="v%3Asp"
></A
></A
><B
>sp</B
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode"
>Node</A
> -> gr a b -> <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:dijkstra"
><A NAME="v%3Adijkstra"
></A
></A
><B
>dijkstra</B
> :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph"
>Graph</A
> gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal"
>Real</A
> b) => <A HREF="Data-Graph-Inductive-Internal-Heap.html#t%3AHeap"
>Heap</A
> b (<A HREF="Data-Graph-Inductive-Graph.html#t%3ALPath"
>LPath</A
> b) -> gr a b -> <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree"
>LRTree</A
> b</TD
></TR
><TR
><TD CLASS="doc"
>Implementation of Dijkstra's shortest path algorithm
</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
>
