Sophie: ghc-7.4.2-4.mga5 i586

ghc-7.4.2-4.mga5.i586.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>GraphColor</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_GraphColor.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">ghc-7.4.2: The GHC API</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Safe Haskell</th><td>None</td></tr></table><p class="caption">GraphColor</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Graph Coloring.
	This is a generic graph coloring library, abstracted over the type of
	the node keys, nodes and colors.
</p></div></div><div id="synopsis"><p id="control.syn" class="caption expander" onclick="toggleSection('syn')">Synopsis</p><ul id="section.syn" class="hide" onclick="toggleSection('syn')"><li class="src short">module <a href="GraphBase.html">GraphBase</a></li><li class="src short">module <a href="GraphOps.html">GraphOps</a></li><li class="src short">module <a href="GraphPpr.html">GraphPpr</a></li><li class="src short"><a href="#v:colorGraph">colorGraph</a> :: (<a href="Unique.html#t:Uniquable">Uniquable</a> k, <a href="Unique.html#t:Uniquable">Uniquable</a> cls, <a href="Unique.html#t:Uniquable">Uniquable</a> color, <a href="../base-4.5.1.0/Data-Eq.html#t:Eq">Eq</a> color, <a href="../base-4.5.1.0/Data-Eq.html#t:Eq">Eq</a> cls, <a href="../base-4.5.1.0/Data-Ord.html#t:Ord">Ord</a> k, <a href="Outputable.html#t:Outputable">Outputable</a> k, <a href="Outputable.html#t:Outputable">Outputable</a> cls, <a href="Outputable.html#t:Outputable">Outputable</a> color) =&gt; <a href="../base-4.5.1.0/Data-Bool.html#t:Bool">Bool</a> -&gt; <a href="../base-4.5.1.0/Data-Int.html#t:Int">Int</a> -&gt; <a href="UniqFM.html#t:UniqFM">UniqFM</a> (<a href="UniqSet.html#t:UniqSet">UniqSet</a> color) -&gt; <a href="GraphBase.html#t:Triv">Triv</a> k cls color -&gt; (<a href="GraphBase.html#t:Graph">Graph</a> k cls color -&gt; k) -&gt; <a href="GraphBase.html#t:Graph">Graph</a> k cls color -&gt; (<a href="GraphBase.html#t:Graph">Graph</a> k cls color, <a href="UniqSet.html#t:UniqSet">UniqSet</a> k, <a href="UniqFM.html#t:UniqFM">UniqFM</a> k)</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src">module <a href="GraphBase.html">GraphBase</a></p></div><div class="top"><p class="src">module <a href="GraphOps.html">GraphOps</a></p></div><div class="top"><p class="src">module <a href="GraphPpr.html">GraphPpr</a></p></div><div class="top"><p class="src"><a name="v:colorGraph" class="def">colorGraph</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<a href="Unique.html#t:Uniquable">Uniquable</a> k, <a href="Unique.html#t:Uniquable">Uniquable</a> cls, <a href="Unique.html#t:Uniquable">Uniquable</a> color, <a href="../base-4.5.1.0/Data-Eq.html#t:Eq">Eq</a> color, <a href="../base-4.5.1.0/Data-Eq.html#t:Eq">Eq</a> cls, <a href="../base-4.5.1.0/Data-Ord.html#t:Ord">Ord</a> k, <a href="Outputable.html#t:Outputable">Outputable</a> k, <a href="Outputable.html#t:Outputable">Outputable</a> cls, <a href="Outputable.html#t:Outputable">Outputable</a> color)</td><td class="doc empty">&nbsp;</td></tr><tr><td class="src">=&gt; <a href="../base-4.5.1.0/Data-Bool.html#t:Bool">Bool</a></td><td class="doc"><p>whether to do iterative coalescing
</p></td></tr><tr><td class="src">-&gt; <a href="../base-4.5.1.0/Data-Int.html#t:Int">Int</a></td><td class="doc"><p>how many times we've tried to color this graph so far.
</p></td></tr><tr><td class="src">-&gt; <a href="UniqFM.html#t:UniqFM">UniqFM</a> (<a href="UniqSet.html#t:UniqSet">UniqSet</a> color)</td><td class="doc"><p>map of (node class -&gt; set of colors available for this class).
</p></td></tr><tr><td class="src">-&gt; <a href="GraphBase.html#t:Triv">Triv</a> k cls color</td><td class="doc"><p>fn to decide whether a node is trivially colorable.
</p></td></tr><tr><td class="src">-&gt; (<a href="GraphBase.html#t:Graph">Graph</a> k cls color -&gt; k)</td><td class="doc"><p>fn to choose a node to potentially leave uncolored if nothing is trivially colorable.
</p></td></tr><tr><td class="src">-&gt; <a href="GraphBase.html#t:Graph">Graph</a> k cls color</td><td class="doc"><p>the graph to color.
</p></td></tr><tr><td class="src">-&gt; (<a href="GraphBase.html#t:Graph">Graph</a> k cls color, <a href="UniqSet.html#t:UniqSet">UniqSet</a> k, <a href="UniqFM.html#t:UniqFM">UniqFM</a> k)</td><td class="doc empty">&nbsp;</td></tr></table></div><div class="doc"><p>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.
</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.11.0</p></div></body></html>