Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > 70ec89744a04da80369b4702b2c37256 > files > 764

ghc-doc-6.10.4-1mdv2010.0.i586.rpm

<!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
>GraphColor</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_GraphColor.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"
>ghc-6.10.4: The GHC API</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"
>GraphColor</FONT
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
>Graph Coloring.
	This is a generic graph coloring library, abstracted over the type of
	the node keys, nodes and colors.
</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"
>module <A HREF="GraphBase.html"
>GraphBase</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
>module <A HREF="GraphOps.html"
>GraphOps</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
>module <A HREF="GraphPpr.html"
>GraphPpr</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AcolorGraph"
>colorGraph</A
> :: (<A HREF="Unique.html#t%3AUniquable"
>Uniquable</A
> k, <A HREF="Unique.html#t%3AUniquable"
>Uniquable</A
> cls, <A HREF="Unique.html#t%3AUniquable"
>Uniquable</A
> color, <A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> color, <A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> cls, <A HREF="../base/Data-Ord.html#t%3AOrd"
>Ord</A
> k, <A HREF="Outputable.html#t%3AOutputable"
>Outputable</A
> k, <A HREF="Outputable.html#t%3AOutputable"
>Outputable</A
> cls, <A HREF="Outputable.html#t%3AOutputable"
>Outputable</A
> color) =&gt; <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
> -&gt; <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -&gt; <A HREF="UniqFM.html#t%3AUniqFM"
>UniqFM</A
> (<A HREF="UniqSet.html#t%3AUniqSet"
>UniqSet</A
> color) -&gt; <A HREF="GraphBase.html#t%3ATriv"
>Triv</A
> k cls color -&gt; (<A HREF="GraphBase.html#t%3AGraph"
>Graph</A
> k cls color -&gt; k) -&gt; <A HREF="GraphBase.html#t%3AGraph"
>Graph</A
> k cls color -&gt; (<A HREF="GraphBase.html#t%3AGraph"
>Graph</A
> k cls color, <A HREF="UniqSet.html#t%3AUniqSet"
>UniqSet</A
> k, <A HREF="UniqFM.html#t%3AUniqFM"
>UniqFM</A
> k)</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"
>module <A HREF="GraphBase.html"
>GraphBase</A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
>module <A HREF="GraphOps.html"
>GraphOps</A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
>module <A HREF="GraphPpr.html"
>GraphPpr</A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:colorGraph"
><A NAME="v%3AcolorGraph"
></A
></A
><B
>colorGraph</B
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: (<A HREF="Unique.html#t%3AUniquable"
>Uniquable</A
> k, <A HREF="Unique.html#t%3AUniquable"
>Uniquable</A
> cls, <A HREF="Unique.html#t%3AUniquable"
>Uniquable</A
> color, <A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> color, <A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> cls, <A HREF="../base/Data-Ord.html#t%3AOrd"
>Ord</A
> k, <A HREF="Outputable.html#t%3AOutputable"
>Outputable</A
> k, <A HREF="Outputable.html#t%3AOutputable"
>Outputable</A
> cls, <A HREF="Outputable.html#t%3AOutputable"
>Outputable</A
> color)</TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="arg"
>=&gt; <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
><TD CLASS="rdoc"
>whether to do iterative coalescing
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
><TD CLASS="rdoc"
>how many times we've tried to color this graph so far.
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="UniqFM.html#t%3AUniqFM"
>UniqFM</A
> (<A HREF="UniqSet.html#t%3AUniqSet"
>UniqSet</A
> color)</TD
><TD CLASS="rdoc"
>map of (node class -&gt; set of colors available for this class).
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="GraphBase.html#t%3ATriv"
>Triv</A
> k cls color</TD
><TD CLASS="rdoc"
>fn to decide whether a node is trivially colorable.
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="GraphBase.html#t%3AGraph"
>Graph</A
> k cls color -&gt; k</TD
><TD CLASS="rdoc"
>fn to choose a node to potentially leave uncolored if nothing is trivially colorable.
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="GraphBase.html#t%3AGraph"
>Graph</A
> k cls color</TD
><TD CLASS="rdoc"
>the graph to color.
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; (<A HREF="GraphBase.html#t%3AGraph"
>Graph</A
> k cls color, <A HREF="UniqSet.html#t%3AUniqSet"
>UniqSet</A
> k, <A HREF="UniqFM.html#t%3AUniqFM"
>UniqFM</A
> k)</TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>Try to color a graph with this set of colors.
	Uses Chaitin's algorithm to color the graph.
	The graph is scanned for nodes which are deamed 'trivially colorable'. These nodes
	are pushed onto a stack and removed from the graph.
	Once this process is complete the graph can be colored by removing nodes from
	the stack (ie in reverse order) and assigning them colors different to their neighbors.
</TD
></TR
></TABLE
></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.4.2</TD
></TR
></TABLE
></BODY
></HTML
>