|
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@36
|
25 |
#define ALMOST_ONE 0.99999999999999
|
|
ladanyi@6
|
26 |
|
|
ladanyi@6
|
27 |
#ifndef MAIN_PART
|
|
hegyi@28
|
28 |
extern std::vector <std::string> edge_property_strings;
|
|
hegyi@28
|
29 |
extern std::vector <double> edge_property_defaults;
|
|
hegyi@28
|
30 |
extern std::vector <std::string> node_property_strings;
|
|
hegyi@28
|
31 |
extern std::vector <double> node_property_defaults;
|
|
ladanyi@6
|
32 |
#endif //MAIN_PART
|
|
ladanyi@6
|
33 |
|
|
ladanyi@6
|
34 |
using namespace lemon;
|
|
ladanyi@6
|
35 |
|
|
ladanyi@6
|
36 |
typedef xy<double> Coordinates;
|
|
ladanyi@6
|
37 |
typedef ListGraph Graph;
|
|
ladanyi@6
|
38 |
typedef Graph::NodeMap<Coordinates> CoordinatesMap;
|
|
ladanyi@6
|
39 |
typedef Graph::Node Node;
|
|
ladanyi@6
|
40 |
typedef Graph::EdgeIt EdgeIt;
|
|
ladanyi@6
|
41 |
typedef Graph::NodeIt NodeIt;
|
|
ladanyi@6
|
42 |
|
|
ladanyi@6
|
43 |
#endif // ALL_INCLUDE_H
|