all_include.h
author hegyi
Thu, 28 Jul 2005 15:54:00 +0000
branchgui
changeset 48 b8ec84524fa2
parent 37 1dc5b49457c0
child 62 80eefca04b1e
permissions -rw-r--r--
cout->cerr, node radius and edge width is now scaled, maps are editable by clicking on texts.
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;
ladanyi@6
    35
#endif //MAIN_PART
ladanyi@6
    36
ladanyi@6
    37
using namespace lemon;
ladanyi@6
    38
ladanyi@6
    39
typedef xy<double> Coordinates;
ladanyi@6
    40
typedef ListGraph Graph;
ladanyi@6
    41
typedef Graph::NodeMap<Coordinates> CoordinatesMap;
ladanyi@6
    42
typedef Graph::Node Node;
ladanyi@6
    43
typedef Graph::EdgeIt EdgeIt;
ladanyi@6
    44
typedef Graph::NodeIt NodeIt;
ladanyi@6
    45
ladanyi@6
    46
#endif // ALL_INCLUDE_H