all_include.h
author ladanyi
Wed, 02 May 2007 20:33:58 +0000
changeset 200 c7ae8642a8d8
parent 174 95872af46fc4
child 201 879e47e5b731
permissions -rw-r--r--
Bugfix.
alpar@174
     1
/* -*- C++ -*-
alpar@174
     2
 *
alpar@174
     3
 * This file is a part of LEMON, a generic C++ optimization library
alpar@174
     4
 *
alpar@174
     5
 * Copyright (C) 2003-2006
alpar@174
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@174
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@174
     8
 *
alpar@174
     9
 * Permission to use, modify and distribute this software is granted
alpar@174
    10
 * provided that this copyright notice appears in all copies. For
alpar@174
    11
 * precise terms see the accompanying LICENSE file.
alpar@174
    12
 *
alpar@174
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@174
    14
 * express or implied, and with no claim as to its suitability for any
alpar@174
    15
 * purpose.
alpar@174
    16
 *
alpar@174
    17
 */
ladanyi@6
    18
ladanyi@6
    19
#ifndef ALL_INCLUDE_H
ladanyi@6
    20
#define ALL_INCLUDE_H
ladanyi@6
    21
ladanyi@6
    22
#include <fstream>
ladanyi@6
    23
#include <iostream>
ladanyi@6
    24
ladanyi@6
    25
#include <vector>
ladanyi@6
    26
ladanyi@6
    27
#include <lemon/list_graph.h>
ladanyi@6
    28
#include <lemon/graph_reader.h>
ladanyi@6
    29
#include <lemon/graph_writer.h>
ladanyi@6
    30
#include <lemon/graph_utils.h>
ladanyi@6
    31
#include <lemon/maps.h>
ladanyi@6
    32
#include <lemon/error.h>
hegyi@150
    33
#include <lemon/dim2.h>
ladanyi@6
    34
hegyi@28
    35
enum {E_WIDTH, E_COLOR, E_TEXT, EDGE_PROPERTY_NUM}; // edge properties;
hegyi@28
    36
enum {N_RADIUS, N_COLOR, N_TEXT, NODE_PROPERTY_NUM}; // node properties;
hegyi@191
    37
enum {N_MAPS, E_MAPS, ARROWS, PAR, EPS_PROPERTY_NUM}; // eps properties;
hegyi@149
    38
enum {MOVE, CREATE_NODE, CREATE_EDGE, ERASER, MAP_EDIT, TOOL_NUM}; // tools;
ladanyi@6
    39
#define RANGE 3
ladanyi@6
    40
#define WIN_WIDTH 900
ladanyi@6
    41
#define WIN_HEIGHT 600
hegyi@48
    42
#define MIN_EDGE_WIDTH 2
hegyi@48
    43
#define MAX_EDGE_WIDTH 40
hegyi@48
    44
#define MIN_NODE_RADIUS 2
hegyi@48
    45
#define MAX_NODE_RADIUS 80
ladanyi@6
    46
ladanyi@6
    47
#ifndef MAIN_PART
hegyi@28
    48
extern std::vector <std::string> edge_property_strings;
hegyi@28
    49
extern std::vector <double> edge_property_defaults;
hegyi@28
    50
extern std::vector <std::string> node_property_strings;
hegyi@28
    51
extern std::vector <double> node_property_defaults;
hegyi@81
    52
extern int longest_property_string_length;
ladanyi@6
    53
#endif //MAIN_PART
ladanyi@6
    54
ladanyi@6
    55
using namespace lemon;
ladanyi@6
    56
hegyi@150
    57
typedef lemon::dim2::Point<double> XY;
ladanyi@6
    58
typedef ListGraph Graph;
ladanyi@6
    59
typedef Graph::Node Node;
alpar@62
    60
typedef Graph::Edge Edge;
ladanyi@6
    61
typedef Graph::EdgeIt EdgeIt;
alpar@69
    62
typedef Graph::InEdgeIt InEdgeIt;
alpar@69
    63
typedef Graph::OutEdgeIt OutEdgeIt;
ladanyi@6
    64
typedef Graph::NodeIt NodeIt;
ladanyi@6
    65
ladanyi@68
    66
const std::string prog_name = "LEMON Graph Editor";
ladanyi@68
    67
ladanyi@6
    68
#endif // ALL_INCLUDE_H