test_SDPColoring.cpp File Reference

test SDP coloring algorithm More...

#include <iostream>
#include <fstream>
#include <string>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/undirected_graph.hpp>
#include <limbo/algorithms/coloring/SDPColoringCsdp.h>
#include <boost/graph/erdos_renyi_generator.hpp>
#include <boost/random/mersenne_twister.hpp>
#include <boost/graph/random.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/version.hpp>
#include <boost/graph/detail/is_same.hpp>

Go to the source code of this file.

Typedefs
typedef adjacency_list< vecS, vecS, undirectedS, property < vertex_index_t, std::size_t, property< vertex_color_t, int > >, property< edge_index_t, std::size_t, property < edge_weight_t, double > >, property< graph_name_t, string > >	graph_type
typedef subgraph< graph_type >	subgraph_type
typedef property < vertex_index_t, std::size_t >	VertexId
typedef property< edge_index_t, std::size_t >	EdgeID
typedef graph_traits < graph_type > ::vertex_descriptor	vertex_descriptor
typedef graph_traits < graph_type > ::edge_descriptor	edge_descriptor
typedef property_map < graph_type, edge_weight_t > ::type	edge_weight_map_type
typedef property_map < graph_type, vertex_color_t > ::type	vertex_color_map_type

Functions
double	simple_graph ()
	test 1: a simple graph
double	random_graph ()
	test 2: a random graph
double	real_graph (string const &filename)
int	main (int argc, char **argv)

Detailed Description

test SDP coloring algorithm

Author

Yibo Lin

Date

Sep 2015

Definition in file test_SDPColoring.cpp.

Function Documentation

int main	(	int	argc,
		char **	argv
	)

main function

Parameters

argc	number of arguments
argv	values of arguments

Returns

0

Definition at line 189 of file test_SDPColoring.cpp.

double real_graph

(

string const &

filename

)

test 3: a real graph from input

Parameters

filename

input file in graphviz format

Definition at line 122 of file test_SDPColoring.cpp.