GreedyColouring.cpp File Reference

Application for performing greedy graph colouring (prototype) More...

#include <iostream>
#include <cassert>
#include <string>
#include <map>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/property_map/dynamic_property_map.hpp>
#include <OKlib/Combinatorics/Hypergraphs/Colourings/GreedyColouring.hpp>

Go to the source code of this file.


int main (const int argc, const char *const argv[])

Detailed Description

Application for performing greedy graph colouring (prototype)

The program reads from standard input an undirected graph in dot-format. It prints the number of vertices, the number of edges, and all vertex degrees, followed by an analysis of the generic colouring algorithm for the input graph.

If no command-line argument is given, then only the lexicographical order and the max- and min-degree order are evaluated, while otherwise all orders are evaluated.

Specify the lexicographical order

Definition in file GreedyColouring.cpp.

Function Documentation