all_include.h
author hegyi
Thu, 05 Jan 2006 12:30:09 +0000
branchgui
changeset 108 bf355fd6563e
parent 81 5ad61c33487c
child 149 930e838ad5b6
permissions -rw-r--r--
Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.
ladanyi@6
     1
// -*- C++ -*- //
ladanyi@6
     2
ladanyi@6
     3
#ifndef ALL_INCLUDE_H
ladanyi@6
     4
#define ALL_INCLUDE_H
ladanyi@6
     5
ladanyi@6
     6
#include <fstream>
ladanyi@6
     7
#include <iostream>
ladanyi@6
     8
ladanyi@6
     9
#include <vector>
ladanyi@6
    10
ladanyi@6
    11
#include <lemon/list_graph.h>
ladanyi@6
    12
#include <lemon/graph_reader.h>
ladanyi@6
    13
#include <lemon/graph_writer.h>
ladanyi@6
    14
#include <lemon/graph_utils.h>
ladanyi@6
    15
#include <lemon/maps.h>
ladanyi@6
    16
#include <lemon/error.h>
ladanyi@6
    17
#include <lemon/xy.h>
ladanyi@6
    18
hegyi@28
    19
enum {E_WIDTH, E_COLOR, E_TEXT, EDGE_PROPERTY_NUM}; // edge properties;
hegyi@28
    20
enum {N_RADIUS, N_COLOR, N_TEXT, NODE_PROPERTY_NUM}; // node properties;
hegyi@32
    21
enum {MOVE, CREATE_NODE, CREATE_EDGE, ERASER, EDGE_MAP_EDIT, NODE_MAP_EDIT, TOOL_NUM}; // tools;
ladanyi@6
    22
#define RANGE 3
ladanyi@6
    23
#define WIN_WIDTH 900
ladanyi@6
    24
#define WIN_HEIGHT 600
hegyi@48
    25
#define MIN_EDGE_WIDTH 2
hegyi@48
    26
#define MAX_EDGE_WIDTH 40
hegyi@48
    27
#define MIN_NODE_RADIUS 2
hegyi@48
    28
#define MAX_NODE_RADIUS 80
ladanyi@6
    29
ladanyi@6
    30
#ifndef MAIN_PART
hegyi@28
    31
extern std::vector <std::string> edge_property_strings;
hegyi@28
    32
extern std::vector <double> edge_property_defaults;
hegyi@28
    33
extern std::vector <std::string> node_property_strings;
hegyi@28
    34
extern std::vector <double> node_property_defaults;
hegyi@81
    35
extern int longest_property_string_length;
ladanyi@6
    36
#endif //MAIN_PART
ladanyi@6
    37
ladanyi@6
    38
using namespace lemon;
ladanyi@6
    39
ladanyi@98
    40
typedef xy<double> XY;
ladanyi@6
    41
typedef ListGraph Graph;
ladanyi@6
    42
typedef Graph::Node Node;
alpar@62
    43
typedef Graph::Edge Edge;
ladanyi@6
    44
typedef Graph::EdgeIt EdgeIt;
alpar@69
    45
typedef Graph::InEdgeIt InEdgeIt;
alpar@69
    46
typedef Graph::OutEdgeIt OutEdgeIt;
ladanyi@6
    47
typedef Graph::NodeIt NodeIt;
ladanyi@6
    48
ladanyi@68
    49
const std::string prog_name = "LEMON Graph Editor";
ladanyi@68
    50
ladanyi@6
    51
#endif // ALL_INCLUDE_H