RhodeCode

	lemon/lp_skeleton.h \

	lemon/list_graph.h \

	lemon/maps.h \

	lemon/math.h \

	lemon/min_cost_arborescence.h \

	lemon/nauty_reader.h \

	lemon/path.h \

  heap_test

  kruskal_test

  maps_test

  min_cost_arborescence_test

  path_test

  preflow_test

	test/heap_test \

	test/kruskal_test \

	test/maps_test \

	test/min_cost_arborescence_test \

	test/path_test \

	test/preflow_test \

test_lp_test_SOURCES = test/lp_test.cc

test_maps_test_SOURCES = test/maps_test.cc

test_mip_test_SOURCES = test/mip_test.cc

test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc

test_path_test_SOURCES = test/path_test.cc

test_preflow_test_SOURCES = test/preflow_test.cc

#include <queue>

#include <cstdlib>

#include <lemon/smart_graph.h>

#include <lemon/concepts/graph.h>

#include <lemon/concepts/maps.h>

#include <lemon/dijkstra.h>

#include <lemon/preflow.h>

using namespace lemon;

typedef SmartDigraph Digraph;