ladanyi@6: // -*- C++ -*- //
ladanyi@6: 
ladanyi@6: #ifndef ALL_INCLUDE_H
ladanyi@6: #define ALL_INCLUDE_H
ladanyi@6: 
ladanyi@6: #include <fstream>
ladanyi@6: #include <iostream>
ladanyi@6: 
ladanyi@6: #include <vector>
ladanyi@6: 
ladanyi@6: #include <lemon/list_graph.h>
ladanyi@6: #include <lemon/graph_reader.h>
ladanyi@6: #include <lemon/graph_writer.h>
ladanyi@6: #include <lemon/graph_utils.h>
ladanyi@6: #include <lemon/maps.h>
ladanyi@6: #include <lemon/error.h>
hegyi@150: #include <lemon/dim2.h>
ladanyi@6: 
hegyi@28: enum {E_WIDTH, E_COLOR, E_TEXT, EDGE_PROPERTY_NUM}; // edge properties;
hegyi@28: enum {N_RADIUS, N_COLOR, N_TEXT, NODE_PROPERTY_NUM}; // node properties;
hegyi@149: enum {MOVE, CREATE_NODE, CREATE_EDGE, ERASER, MAP_EDIT, TOOL_NUM}; // tools;
ladanyi@6: #define RANGE 3
ladanyi@6: #define WIN_WIDTH 900
ladanyi@6: #define WIN_HEIGHT 600
hegyi@48: #define MIN_EDGE_WIDTH 2
hegyi@48: #define MAX_EDGE_WIDTH 40
hegyi@48: #define MIN_NODE_RADIUS 2
hegyi@48: #define MAX_NODE_RADIUS 80
ladanyi@6: 
ladanyi@6: #ifndef MAIN_PART
hegyi@28: extern std::vector <std::string> edge_property_strings;
hegyi@28: extern std::vector <double> edge_property_defaults;
hegyi@28: extern std::vector <std::string> node_property_strings;
hegyi@28: extern std::vector <double> node_property_defaults;
hegyi@81: extern int longest_property_string_length;
ladanyi@6: #endif //MAIN_PART
ladanyi@6: 
ladanyi@6: using namespace lemon;
ladanyi@6: 
hegyi@150: typedef lemon::dim2::Point<double> XY;
ladanyi@6: typedef ListGraph Graph;
ladanyi@6: typedef Graph::Node Node;
alpar@62: typedef Graph::Edge Edge;
ladanyi@6: typedef Graph::EdgeIt EdgeIt;
alpar@69: typedef Graph::InEdgeIt InEdgeIt;
alpar@69: typedef Graph::OutEdgeIt OutEdgeIt;
ladanyi@6: typedef Graph::NodeIt NodeIt;
ladanyi@6: 
ladanyi@68: const std::string prog_name = "LEMON Graph Editor";
ladanyi@68: 
ladanyi@6: #endif // ALL_INCLUDE_H