1.1 --- a/demo/coloring.cc	Fri Oct 14 11:01:21 2005 +0000
     1.2 +++ b/demo/coloring.cc	Fri Oct 14 11:02:34 2005 +0000
     1.3 @@ -14,15 +14,25 @@
     1.4   *
     1.5   */
     1.6  
     1.7 +///\ingroup demos
     1.8 +///\file
     1.9 +///\brief Coloring of a graph.
    1.10 +///
    1.11 +/// This example shows how can we color the nodes of a plan graph efficiently
    1.12 +/// with six colors.
    1.13 +///
    1.14 +/// \include coloring.cc
    1.15 +
    1.16  #include <vector>
    1.17  
    1.18 +#include <iostream>
    1.19 +
    1.20  #include <lemon/smart_graph.h>
    1.21 -#include <lemon/bin_heap.h>
    1.22 +#include <lemon/linear_heap.h>
    1.23  #include <lemon/graph_reader.h>
    1.24  #include <lemon/graph_to_eps.h>
    1.25  
    1.26  #include <fstream>
    1.27 -#include <iostream>
    1.28  
    1.29  
    1.30  using namespace std;
    1.31 @@ -51,7 +61,7 @@
    1.32    Graph::NodeMap<int> color(graph, -2);
    1.33    
    1.34    Graph::NodeMap<int> heapMap(graph, -1);
    1.35 -  BinHeap<Node, int, Graph::NodeMap<int> > heap(heapMap);
    1.36 +  LinearHeap<Node, Graph::NodeMap<int> > heap(heapMap);
    1.37    
    1.38    for (NodeIt it(graph); it != INVALID; ++it) {
    1.39      heap.push(it, countOutEdges(graph, it));