COIN-OR::LEMON - Graph Library

source: glemon/all_include.h @ 1:67188bd752db

Last change on this file since 1:67188bd752db was 1:67188bd752db, checked in by Peter Hegyi <hegyi@…>, 11 years ago

SVN revision 3500 made compilable with Lemon 1.0.

File size: 2.0 KB
Line 
1/* -*- C++ -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8 *
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
12 *
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
15 * purpose.
16 *
17 */
18
19#ifndef ALL_INCLUDE_H
20#define ALL_INCLUDE_H
21
22#include <fstream>
23#include <iostream>
24
25#include <vector>
26
27#include <lemon/list_graph.h>
28#include <lemon/graph_utils.h>
29#include <lemon/maps.h>
30#include <lemon/error.h>
31#include <lemon/dim2.h>
32
33enum {E_WIDTH, E_COLOR, E_TEXT, EDGE_PROPERTY_NUM}; // arc properties;
34enum {N_RADIUS, N_COLOR, N_TEXT, NODE_PROPERTY_NUM}; // node properties;
35enum {N_MAPS, E_MAPS, ARROWS, PAR, EPS_PROPERTY_NUM}; // eps properties;
36enum {MOVE, CREATE_NODE, CREATE_EDGE, ERASER, MAP_EDIT, TOOL_NUM}; // tools;
37#define RANGE 3
38#define WIN_WIDTH 900
39#define WIN_HEIGHT 600
40#define MIN_EDGE_WIDTH 2
41#define MAX_EDGE_WIDTH 40
42#define MIN_NODE_RADIUS 2
43#define MAX_NODE_RADIUS 80
44
45#ifndef MAIN_PART
46extern std::vector <std::string> arc_property_strings;
47extern std::vector <double> arc_property_defaults;
48extern std::vector <std::string> node_property_strings;
49extern std::vector <double> node_property_defaults;
50extern int longest_property_string_length;
51#endif //MAIN_PART
52
53using namespace lemon;
54
55typedef lemon::dim2::Point<double> XY;
56typedef ListDigraph Digraph;
57typedef Digraph::Node Node;
58typedef Digraph::Arc Arc;
59typedef Digraph::ArcIt ArcIt;
60typedef Digraph::InArcIt InArcIt;
61typedef Digraph::OutArcIt OutArcIt;
62typedef Digraph::NodeIt NodeIt;
63
64const std::string prog_name = "LEMON Digraph Editor";
65
66enum MapType
67{
68  NUM  = 1 << 0,
69  STR  = 1 << 1,
70  ALL  = (1 << 0) | (1 << 1)
71};
72
73#endif // ALL_INCLUDE_H
Note: See TracBrowser for help on using the repository browser.