# HG changeset patch
# User deba
# Date 1129287754 0
# Node ID 0c7d717b953833864c1b332d70b270361cfd54c8
# Parent  f214631ea1ac82d1c381202fc092d332473ec04a
Doc and changing heap

diff -r f214631ea1ac -r 0c7d717b9538 demo/coloring.cc
--- a/demo/coloring.cc	Fri Oct 14 11:01:21 2005 +0000
+++ b/demo/coloring.cc	Fri Oct 14 11:02:34 2005 +0000
@@ -14,15 +14,25 @@
  *
  */
 
+///\ingroup demos
+///\file
+///\brief Coloring of a graph.
+///
+/// This example shows how can we color the nodes of a plan graph efficiently
+/// with six colors.
+///
+/// \include coloring.cc
+
 #include <vector>
 
+#include <iostream>
+
 #include <lemon/smart_graph.h>
-#include <lemon/bin_heap.h>
+#include <lemon/linear_heap.h>
 #include <lemon/graph_reader.h>
 #include <lemon/graph_to_eps.h>
 
 #include <fstream>
-#include <iostream>
 
 
 using namespace std;
@@ -51,7 +61,7 @@
   Graph::NodeMap<int> color(graph, -2);
   
   Graph::NodeMap<int> heapMap(graph, -1);
-  BinHeap<Node, int, Graph::NodeMap<int> > heap(heapMap);
+  LinearHeap<Node, Graph::NodeMap<int> > heap(heapMap);
   
   for (NodeIt it(graph); it != INVALID; ++it) {
     heap.push(it, countOutEdges(graph, it));